# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
969691 | vjudge1 | Global Warming (CEOI18_glo) | C++17 | 48 ms | 2528 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;
int arr[200007];
int main()
{
cin.tie(nullptr)->ios::sync_with_stdio(0);
int n,d;
cin>>n>>d;
for(int i=0;i<n;i++)cin>>arr[i];
vector<int> dp;
int ans=0,pref[200007]={};
for(int i=0;i<n;i++)
{
int idx=lower_bound(dp.begin(),dp.end(),arr[i])-dp.begin();
if(idx==dp.size())dp.push_back(arr[i]);
else dp[idx]=arr[i];
pref[i]=idx+1;
}
ans=dp.size();
dp.clear();
for(int i=n-1;i>=0;i--)
{
int idx=lower_bound(dp.begin(),dp.end(),-arr[i]+d)-dp.begin();
ans=max(ans,pref[i]+idx);
idx = upper_bound(dp.begin(),dp.end(),-arr[i])-dp.begin();
if(idx==dp.size())dp.push_back(-arr[i]);
else dp[idx]=-arr[i];
}
cout<<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... |