# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1108947 | csibe_csavo | Global Warming (CEOI18_glo) | C++14 | 47 ms | 5584 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 <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n,d; cin>>n>>d;
vector<int> v(n+2);
for(int i=1; i<=n; i++)
cin>>v[i];
vector<int> lis,dpel(n+1);
for(int i=1; i<=n; i++)
{
int ind=lower_bound(lis.begin(),lis.end(),v[i])-lis.begin();
if(ind>=lis.size()) lis.push_back(v[i]);
else lis[ind]=v[i];
dpel[i]=lis.size();
}
vector<int> dphat(n+2),r(n+2);
lis.clear();
for(int i=n; i>0; i--)
{
int ujert=v[i]-d;
ujert=-ujert;
int ind=lower_bound(lis.begin(),lis.end(),ujert)-lis.begin();
r[i]=ind+1;
v[i]=-v[i];
ind=lower_bound(lis.begin(),lis.end(),v[i])-lis.begin();
if(ind<lis.size()) lis[ind]=v[i];
else lis.push_back(v[i]);
}
int ans=1;
for(int i=1; i<=n; i++)
ans=max(ans,dpel[i]+r[i]-1);
cout<<ans<<"\n";
}
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... |