Submission #1215005

#TimeUsernameProblemLanguageResultExecution timeMemory
1215005lizi14Global Warming (CEOI18_glo)C++20
0 / 100
2093 ms1588 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n,d; cin>>n>>d; int x[n]; int ans=0; for(int i=0; i<n; i++){ cin>>x[i]; //a=min(x[i],a); } for(int i=0; i<n; i++){ x[i]-=d; vector<int>v; v.push_back(x[0]); for(int j=1; j<n; j++){ int l=0,r=v.size(); int ans1=-1; while(l<=r){ int mid=(l+r)/2; if(x[j]<=v[mid]){ r=mid-1; } else { l=mid+1; ans1=mid; } } if(ans1!=-1){ v[ans1]=x[j]; } else v.push_back(x[j]); } int m=v.size(); //cout<<m<<endl; ans=max(ans,m); // for(auto a:v){ // cout<<a<<" "; // } // cout<<endl; } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...