| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1048503 | MrAndria | Global Warming (CEOI18_glo) | C++14 | 89 ms | 4472 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 ff first
#define ss second
#define pb push_back
//#define int long long
pair <int,int> p[200005];
int a[200005],mx,n,k,x;
int main(){
cin>>n>>x;
for(int i=1;i<=n;i++){
cin>>a[i];
}
vector <int> v;
p[0]=make_pair(0,0);
for(int i=1;i<=n;i++){
k=lower_bound(v.begin(),v.end(),a[i])-v.begin();
if(k==v.size()){
v.pb(a[i]);
}else{
v[k]=a[i];
}
p[i]=make_pair(v.size(),v.back());
}
v.clear();
mx=max(mx,p[n].ff);
for(int i=n;i>=1;i--){
k=lower_bound(v.begin(),v.end(),-a[i])-v.begin();
if(k==v.size()){
v.pb(-a[i]);
}else{
v[k]=-a[i];
}
if(-v.back()+x>p[i-1].ss){
mx=max(mx,p[i-1].ff+int(v.size()));
}
}
cout<<mx<<endl;
}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... | ||||
