algorithm-ps/11053.cpp at master · sky7th/algorithm-ps · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
// N*N
#include <bits/stdc++.h>
using namespace std;

int A[1001];
int D[1001];
int N, res;

int main(void) {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> N;
    for (int i = 0; i < N; i++)
        cin >> A[i];
    for (int i = 0; i < N; i++) {
        int len = 0;
        for (int j = 0; j < i; j++) {
            if (A[j] < A[i])
                len = max(len, D[j]);
        }
        D[i] = len + 1;
        res = max(res, D[i]);
    }
    cout << res;
}

// logN* N
#include <bits/stdc++.h>
using namespace std;

int A[1001];
int D[1001];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int N;
    cin >> N;
    for (int i=0; i<N; i++)
        cin >> A[i];
    D[0] = A[0];
    int len = 1;
    for(int i = 1; i < N; ++i) {
        if (A[i] > D[len-1])
            D[len++] = A[i];
        else
            *lower_bound(D, D + len, A[i]) = A[i];
    }
    cout << len;
    return 0;
}