Submission #1072365

#TimeUsernameProblemLanguageResultExecution timeMemory
1072365ventusliberumGlobal Warming (CEOI18_glo)C++17
100 / 100
50 ms4700 KiB
/** * title: Global Warming **/ #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define si(x) int(x.size()) #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--) template <class T, class U> inline bool chmax(T &a, U b) { return (a < b ? a = b, 1 : 0); } template <class T, class U> inline bool chmin(T &a, U b) { return (b < a ? a = b, 1 : 0); } template <class T> istream &operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; } template <class T> ostream &operator<<(ostream &os, const vector<T> &v) { rep(i, si(v)) os << (i ? " " : "") << v[i]; return os; } using ll = long long; constexpr int inf = 1001001001; constexpr long long infll = 4004004004004004004LL; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, x; cin >> n >> x; vector<int> t(n); cin >> t; vector<int> lis(n, inf), f(n); int ans = 0; rep(i, n) { int j = lower_bound(all(lis), t[i]) - lis.begin(); f[i] = j; j = lower_bound(all(lis), t[i] - x) - lis.begin(); lis[j] = t[i] - x; } lis.assign(n, inf); rrep(i, n) { int j = lower_bound(all(lis), -t[i]) - lis.begin(); chmax(ans, f[i] + j + 1); lis[j] = -t[i]; } cout << ans << '\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...