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;
using ll = long long;
ll N, X;
ll A[200005];
int main(){
cin.tie(0) -> sync_with_stdio(false);
cin >> N >> X;
vector<ll> dp;
for(int i = 1; i <= N; i++){
cin >> A[i];
if(dp.empty() || dp.back() < A[i]){
dp.push_back(A[i]);
} else {
*lower_bound(dp.begin(), dp.end(), A[i]) = A[i];
}
}
cout << dp.size();
}
# | 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... |