# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
846967 | 2023-09-08T19:11:41 Z | SUNWOOOOOOOO | Financial Report (JOI21_financial) | C++17 | 36 ms | 4000 KB |
#include <bits/stdc++.h> using namespace std; const int mxN = 300005; int n, d, A[mxN], lis[mxN]; int main() { scanf("%d %d", &n, &d); for (int i = 1; i <= n; i++) scanf("%d", &A[i]); int ans = 0; for (int i = 1; i <= n; i++){ if (A[i] > lis[ans]) lis[++ans] = A[i]; else { int idx = lower_bound(lis, lis + ans, A[i]) - lis; lis[idx] = A[i]; } } printf("%d\n", ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2392 KB | Output is correct |
2 | Incorrect | 1 ms | 2396 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2392 KB | Output is correct |
2 | Incorrect | 1 ms | 2396 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2392 KB | Output is correct |
2 | Incorrect | 1 ms | 2396 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 3836 KB | Output is correct |
2 | Incorrect | 31 ms | 4000 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 28 ms | 3924 KB | Output is correct |
2 | Incorrect | 36 ms | 2476 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2392 KB | Output is correct |
2 | Incorrect | 1 ms | 2396 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |