# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1108917 | csibe_csavo | Global Warming (CEOI18_glo) | C++14 | 2067 ms | 3136 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 n,d;
int lis(vector<int> &v)
{
vector<int> s{v[1]};
for(int i=2; i<=n; i++)
{
int ind=lower_bound(s.begin(),s.end(),v[i])-s.begin();
if(ind>=s.size()) s.push_back(v[i]);
else s[ind]=v[i];
}
int p=s.size();
return p;
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>d;
vector<int> v(n+1);
for(int i=1; i<=n; i++)
cin>>v[i];
int ans=lis(v);
for(int i=1; i<n; i++)
{
v[i]-=d;
ans=max(ans,lis(v));
}
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... |