Submission #376092

#TimeUsernameProblemLanguageResultExecution timeMemory
376092YJUGlobal Warming (CEOI18_glo)C++14
100 / 100
66 ms6632 KiB
#include<bits/stdc++.h> #pragma GCC optimize("unroll-loops,no-stack-protector,Ofast") using namespace std; typedef long long ll; typedef pair<ll,ll> pll; typedef long double ld; const ll N=2e5+5; const ll MOD=1e9+7; const ll INF=(1LL<<61); const ld pi=acos(-1); #define REP(i,n) for(int i=0;i<n;++i) #define REP1(i,n) for(int i=1;i<=n;++i) #define pb push_back #define mp make_pair #define X first #define Y second #define lwb lower_bound #define SZ(_a) (ll)_a.size() vector<ll> lis; ll n,d,u[N],dp[N],ans; int main(){ ios_base::sync_with_stdio(0);cin.tie(0); cin>>n>>d; REP(i,n)cin>>u[i]; for(int i=n-1;i>=0;i--){ ll id=lwb(lis.begin(),lis.end(),-u[i])-lis.begin(); if(id==SZ(lis))lis.pb(-u[i]); else lis[id]=-u[i]; dp[i]=id+1; } ans=dp[0]; lis.clear(); REP(i,n){ ll id=lwb(lis.begin(),lis.end(),u[i]+d)-lis.begin(); ans=max(ans,dp[i]+id); id=lwb(lis.begin(),lis.end(),u[i])-lis.begin(); if(id==SZ(lis))lis.pb(u[i]); else lis[id]=u[i]; } cout<<ans<<"\n"; return 0; } /* 7 1 5 0 5 0 7 0 3 0 4 0 4 3 0 2 1 0 */
#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...