# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
164091 | errorgorn | Global Warming (CEOI18_glo) | C++14 | 834 ms | 3224 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 <cstdio>
#include <vector>
using namespace std;
int n,k;
int arr[200005];
int test(int i){
vector<int> v;
vector<int>::iterator it;
v.push_back(arr[0]);
for (int x=1;x<i;x++){
if (v.back()<arr[x]) v.push_back(arr[x]);
else{
it=lower_bound(v.begin(),v.end(),arr[x]);
v[it-v.begin()]=arr[x];
}
}
for (int x=i;x<n;x++){
if (v.back()<arr[x]+k) v.push_back(arr[x]+k);
else{
it=lower_bound(v.begin(),v.end(),arr[x]+k);
v[it-v.begin()]=arr[x]+k;
}
}
return v.size();
}
int main(){
scanf("%d%d",&n,&k);
for (int x=0;x<n;x++) scanf("%d",&arr[x]);
int s=1,e=n;
int t1,t2;
int v1,v2;
while (e-s>3){
t1=s+(e-s)/3;
t2=s+(e-s)*2/3;
v1=test(t1);
v2=test(t2);
if (v1>v2){
e=t2;
}
else{
s=t1;
}
}
int best=-1;
for (int x=s;x<=e;x++){
best=max(best,test(x));
}
printf("%d\n",best);
}
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... |