Submission #126070

#TimeUsernameProblemLanguageResultExecution timeMemory
126070briansuGlobal Warming (CEOI18_glo)C++14
100 / 100
72 ms6384 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll,ll> ii; #define REP(i, n) for(int i = 0;i < n;i ++) #define REP1(i, n) for(int i = 1;i <= n;i ++) #define FILL(i, n) memset(i, n, sizeof(i)) #define X first #define Y second #define pb push_back #define SZ(_a) ((int)(_a).size()) #define ALL(_a) (_a).begin(), (_a).end() #ifdef brian #define IOS() template<typename T>void _do(T &&x){cerr<<x<<endl;} template<typename T, typename ...t> void _do(T &&x, t &&...X){cerr<<x<<", ";_do(X...);} #define debug(...) {\ fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, #__VA_ARGS__);\ _do(__VA_ARGS__);\ } #else #define IOS() ios_base::sync_with_stdio(0);cin.tie(0); #define debug(...) #define endl '\n' #endif const ll MAXn = 2e5 + 5; const ll INF = ll(1e17); const ll MOD = 1000000007; ll d[MAXn], dt[MAXn]; int main(){ IOS(); ll n, x; cin>>n>>x; REP1(i, n)cin>>d[i]; vector<ll> v; for(int i = n;i > 0;i --){ if(!SZ(v) || d[i] < v.back())v.pb(d[i]), dt[i] = SZ(v); else { ll t = lower_bound(ALL(v), d[i], greater<ll>()) - v.begin(); dt[i] = t + 1; v[t] = d[i]; } } ll mx = SZ(v); v.clear(); REP1(i, n) { mx = max(mx, dt[i] + (lower_bound(ALL(v), d[i] + x) - v.begin())); if(!SZ(v) || d[i] > v.back())v.pb(d[i]); else *lower_bound(ALL(v), d[i]) = d[i]; } cout<<mx<<endl; }
#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...