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 = 200010;
int N, X;
int v[MAXN];
int main(){
cin.tie(NULL)->sync_with_stdio(false);
cin >> N >> X;
for(int i = 0; i < N; ++i) cin >> v[i];
vector<int> lis;
int size_0 = 0;
for(int i = 0; i < N; ++i){
{
auto it = lower_bound(lis.begin(), lis.end(), v[i]+X);
if(it == lis.end()) lis.push_back(v[i]+X);
else *it = v[i]+X;
}
{
auto it = lower_bound(lis.begin(), lis.end(), v[i]);
assert(it != lis.end());
auto pos = min((int)(it - lis.begin()), size_0);
lis[pos] = v[i];
size_0 = max(size_0, pos + 1);
}
}
cout << lis.size() << "\n";
}
# | 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... |