This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5+10;
const int INF = 1e9;
#define pb push_back
int n, x, resp, v[MAXN], LIS[MAXN];
int main () {
cin >> n >> x;
for(int i = 1; i <= n; i++) {
cin >> v[i];
LIS[i] = INF;
}
for(int i = 1; i <= n; i++) {
int ptr = lower_bound(LIS+1, LIS+1+n, v[i]) - LIS;
LIS[ptr] = v[i];
resp = max(resp, ptr);
}
cout << resp;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |