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>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
signed main(){
ios_base::sync_with_stdio();
cin.tie(0);cout.tie(0);
int n,x;
cin>>n>>x;
vector <int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
vector <int> v(n+1,1e18);
v[0]=-1e18;
vector <int> l(n),r(n);
for(int i=0;i<n;i++){
auto it=lower_bound(all(v),a[i]);
int pos=it-v.begin();
v[pos]=a[i];
l[i]=pos;
}
for(int i=0;i<n;i++)a[i]*=-1;
for(int i=1;i<=n;i++)v[i]=1e18;
for(int i=n-1;i>=0;i--){
auto it=lower_bound(all(v),a[i]+x);
int pos=it-v.begin();
r[i]=pos;
it=lower_bound(all(v),a[i]);
pos=it-v.begin();
v[pos]=a[i];
}
int mx=0;
for(int i=0;i<n;i++){
mx=max(mx,l[i]+r[i]-1);
}
cout<<mx<<"\n";
}
/*
4
1 2200 700
1 1800 10
1 2550 9999
1 2000 750
3
1 1500 300
1 1900 1500
1 2400 4550
*/
# | 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... |