Submission #927460

#TimeUsernameProblemLanguageResultExecution timeMemory
927460OAleksaGlobal Warming (CEOI18_glo)C++14
28 / 100
2048 ms10120 KiB
#include <bits/stdc++.h> using namespace std; #define f first #define s second #define int long long const int N = 2e5 + 69; int n, a[N], x, dp[N]; signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int tt = 1; //cin >> tt; while (tt--) { cin >> n >> x; for (int i = 1;i <= n;i++) cin >> a[i]; int ans = 1; auto Solve = [&](vector<int> a) { int r = 0; vector<int> dp(n, 1e9); for (int i = 0;i < n;i++) { auto u = lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin(); if (dp[u] == 1e9) r++; dp[u] = a[i]; } return r; }; for (int i = 1;i <= n;i++) { vector<int> b; for (int j = 1;j <= n;j++) b.push_back(a[j]); for (int j = 1;j <= i;j++) b[j - 1] -= x; ans = max(ans, Solve(b)); } cout << ans << '\n'; } return 0; }
#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...