# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1097163 | 2024-10-06T10:56:11 Z | papi | Global Warming (CEOI18_glo) | C++14 | 26 ms | 3320 KB |
#include <bits/stdc++.h> #define fi first #define se second #define I2 pair <int, int> #define L2 pair <long long, long long> #define IL pair <int, long long> #define LI pair <long long, int> using namespace std; const int MAXN = 1e6 + 7, MOD = 1e9 + 7, base = 31; const long long oo = 1e18; int DX[] = {0, -1, 0, 1}, DY[] = {-1, 0, 1, 0}; int n, ans; int lis[MAXN], a[MAXN]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); if (fopen("TEXT.INP", "r")){ freopen("TEXT.INP", "r", stdin); freopen("TEXT.OUT", "w", stdout); } cin >> n; for (int i = 1; i <= n; i++){ cin >> a[i]; } lis[1] = a[1]; for (int i = 2; i <= n; i++){ int k = lower_bound(lis + 1, lis + ans + 1, a[i]) - lis; lis[k] = a[i]; ans = max(ans, k); } cout << ans; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 25 ms | 3320 KB | Output is correct |
2 | Correct | 23 ms | 3136 KB | Output is correct |
3 | Correct | 24 ms | 3164 KB | Output is correct |
4 | Correct | 26 ms | 3164 KB | Output is correct |
5 | Correct | 13 ms | 2648 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 1116 KB | Output is correct |
2 | Correct | 6 ms | 1116 KB | Output is correct |
3 | Correct | 6 ms | 1116 KB | Output is correct |
4 | Incorrect | 4 ms | 856 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 12 ms | 1624 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |