Submission #652154

#TimeUsernameProblemLanguageResultExecution timeMemory
652154pauloamedGlobal Warming (CEOI18_glo)C++14
27 / 100
54 ms3552 KiB
#include<bits/stdc++.h> using namespace std; const int MAXN = 200010; int N, X; int v[MAXN]; int main(){ cin.tie(NULL)->sync_with_stdio(false); cin >> N >> X; for(int i = 0; i < N; ++i) cin >> v[i]; vector<int> lis; for(int i = 0; i < N; ++i){ { auto it = lower_bound(lis.begin(), lis.end(), v[i]+X); if(it == lis.end()) lis.push_back(v[i]+X); else *it = v[i]+X; } { auto it = lower_bound(lis.begin(), lis.end(), v[i]); if(it == lis.end()) lis.push_back(v[i]); else *it = v[i]; } } cout << lis.size() << "\n"; }
#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...