/*
* With a little appreciation, in a mostly hollow tone, she says, "Delightful." As if the world has any meaning.
* TASK :
* AUTHOR : Marszpace
*/
#include <algorithm>
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,x;
cin >> n >> x;
vector<int> arr(n);
for(int i=0;i<n;i++){
cin >> arr[i];
}
vector<int> lis,len,tail;
for(int i=0;i<n;i++){
if(lis.empty()||lis.back()<arr[i]){
lis.push_back(arr[i]);
}
else{
int idx=lower_bound(lis.begin(),lis.end(),arr[i])-lis.begin();
lis[idx]=arr[i];
}
len.push_back(lis.size());
tail.push_back(lis.back());
}
int res=-1;
vector<int> lds;
for(int i=n-1;i>=1;i--){
if(lds.empty()||lis.back()>arr[i]){
lds.push_back(arr[i]);
}
else{
int idx=lower_bound(lds.begin(),lds.end(),arr[i],greater<int>())-lis.begin();
lds[idx]=arr[i];
}
if(tail[i-1]<lds.back()+x){
res=max(res,(int)lds.size()+len[i-1]);
}
}
cout << res;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
30 ms |
8512 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
9 ms |
3032 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
17 ms |
4540 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |