# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
37384 | 2017-12-25T03:41:23 Z | HardNut | Money (IZhO17_money) | C++14 | 0 ms | 5924 KB |
#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 5; typedef long long ll; int n, a[N], ans; set<int> st; bool us; int main() { scanf("%d", &n); for (int i = 1; i <= n; i++) { scanf("%d", &a[i]); } int i = 1; st.insert((int)1e9); while (i <= n) { int x = *upper_bound(st.begin(), st.end(), a[i]); int l = i; while (a[i + 1] >= a[i] && a[i + 1] <= x) { st.insert(a[i]); i++; } i++; ans++; } printf("%d", ans); } /** 6 1 5 2 5 5 6 **/
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5924 KB | Output is correct |
2 | Incorrect | 0 ms | 5924 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5924 KB | Output is correct |
2 | Incorrect | 0 ms | 5924 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5924 KB | Output is correct |
2 | Incorrect | 0 ms | 5924 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 5924 KB | Output is correct |
2 | Incorrect | 0 ms | 5924 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |