# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
36946 | nickyrio | Money (IZhO17_money) | C++14 | 1500 ms | 52788 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i<= b; ++i)
#define FORD(i, a, b) for (int i = a; i>=b; --i)
#define REP(i, a) for (int i = 0; i<a; ++i)
#define N 1001000
#define pp pair<int, int>
#define bit(S, i) (((S) >> i) & 1)
#define IO cin.tie(NULL);cout.tie(NULL);
#define taskname "test"
using namespace std;
int n, a[N];
set<int> used;
int main() {
//freopen(taskname".inp","r",stdin);
//freopen(taskname".out","w",stdout);
IO;
scanf("%d", &n);
FOR(i, 1, n) scanf("%d", &a[i]);
int start = 1;
int cnt = 0;
while (start <= n) {
cnt++;
int last = start + 1;
used.insert(a[start]);
int lim;
if (used.upper_bound(a[start]) == used.end()) lim = 1e9;
else lim = *used.upper_bound(a[start]);
while (last <= n && a[last] <= lim && a[last] >= a[last - 1]) {
used.insert(a[last]); last++;
}
start = last;
}
printf("%d", cnt);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |