Submission #316763

#TimeUsernameProblemLanguageResultExecution timeMemory
316763LifeHappen__Global Warming (CEOI18_glo)C++14
100 / 100
63 ms4216 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int rnd(int l,int r){return l+rng()%(r-l+1);} #define forinc(a,b,c) for(int a=b, _c=c; a<=_c; ++a) #define fordec(a,b,c) for(int a=b, _c=c; a>=_c; --a) #define forv(a,b) for(auto &a:b) #define fasty ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0) #define ar array #define ii pair<int,int> #define fi first #define se second #define pb push_back #define eb emplace_back #define all(a) begin(a),end(a) #define reset(f,x) memset(f,x,sizeof(f)) #define bit(x,i) (x>>(i-1)&1ll) #define on(x,i) (x|(1ll<<(i-1))) #define off(x,i) (x&~(1ll<<(i-1))) const int N=2e5+5; int n,x,a[N],b[N],pf[N],m; int32_t main(){ fasty; cin>>n>>x; forinc(i,1,n) cin>>a[i]; forinc(i,1,n){ int k=lower_bound(b+1, b+m+1, a[i])-b; b[k]=a[i]; m=max(m,k); pf[i]=k; } int ans=0; m=0; fordec(i,n,1){ ans=max(ans, (int)(lower_bound(b+1, b+m+1, a[i], greater<int>())-b-1)+pf[i]); int k=lower_bound(b+1, b+m+1, a[i]+x, greater<int>())-b; b[k]=a[i]+x; m=max(m,k); } cout<<ans<<'\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...