Submission #566897

#TimeUsernameProblemLanguageResultExecution timeMemory
566897guagua0407Global Warming (CEOI18_glo)C++17
38 / 100
2077 ms6940 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define f first #define s second #define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int main() {_ int n,x; cin>>n>>x; vector<int> num(n); for(auto &u:num){ cin>>u; } int ans=0; set<int> s; if(x==0){ for(int i=0;i<n;i++){ int x=num[i]; if(s.lower_bound(x)!=s.end()) s.erase(s.lower_bound(x)); s.insert(x); } cout<<s.size(); return 0; } for(int r=0;r<n;r++){ s.clear(); for(int i=0;i<n;i++){ int temp; if(i<=r) temp=num[i]-x; else temp=num[i]; if(s.lower_bound(temp)!=s.end()) s.erase(s.lower_bound(temp)); s.insert(temp); } ans=max(ans,(int)(s.size())); } cout<<ans; return 0; } //maybe its multiset not set
#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...