# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
968703 | 2024-04-23T21:26:31 Z | blackslex | Global Warming (CEOI18_glo) | C++17 | 47 ms | 4704 KB |
#include<bits/stdc++.h> using namespace std; int n, d; int main() { scanf("%d %d", &n, &d); vector<int> t(n), dp(n), dp2(n); for (auto &e: t) scanf("%d", &e); vector<int> c; for (int i = 0; i < n; i++) { auto lower = lower_bound(c.begin(), c.end(), t[i]); if (lower == c.end()) c.emplace_back(t[i]), dp[i] = c.size(); else *lower = t[i], dp[i] = lower - c.begin() + 1; } int ans = c.size(); c.clear(); for (int i = n - 1; i >= 0; i--) { auto lower = lower_bound(c.begin(), c.end(), -t[i]); dp2[i] = lower_bound(c.begin(), c.end(), -t[i] + d) - c.begin(); if (lower == c.end()) c.emplace_back(-t[i]); else *lower = -t[i]; } for (int i = 1; i < n; i++) ans = max(ans, dp[i - 1] + dp2[i]); printf("%d", ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 47 ms | 4688 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 11 ms | 1372 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 2392 KB | Output is correct |
2 | Correct | 19 ms | 2396 KB | Output is correct |
3 | Correct | 39 ms | 4704 KB | Output is correct |
4 | Incorrect | 24 ms | 4564 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |