# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
503871 | krit3379 | Global Warming (CEOI18_glo) | C++14 | 47 ms | 8888 KiB |
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;
#define N 300005
long long a[N],b[N],c[N],dp1[N];
vector<long long> s1,s2;
int main(){
long long n,d,i,ans=0;
scanf("%lld %lld",&n,&d);
for(i=1;i<=n;i++)scanf("%lld",&a[i]),b[i]=-a[i];
for(i=1;i<=n;i++){
auto x=lower_bound(s1.begin(),s1.end(),a[i]);
if(x==s1.end())s1.push_back(a[i]);
else *x=a[i];
dp1[i]=s1.size();
c[i]=s1.back();
}
for(i=n;i>0;i--){
int it=lower_bound(s2.begin(),s2.end(),-c[i]+d)-(s2.begin());
ans=max(ans,dp1[i]+it);
auto x=lower_bound(s2.begin(),s2.end(),b[i]);
if(x==s2.end())s2.push_back(b[i]);
else *x=b[i];
//printf("i=%d dp=%d it=%d\n",i,dp1[i-1],it);
}
printf("%lld\n",ans);
return 0;
}
Compilation message (stderr)
# | 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... |