# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
319226 | dolphingarlic | Money (IZhO17_money) | C++14 | 251 ms | 15000 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>
using namespace std;
int n, a[1000005], bit[1000005];
void update(int pos) { for (; pos < 1000005; pos += (pos & (-pos))) bit[pos]++; }
int query(int a) {
int ans = 0;
for (; a; a -= (a & (-a))) ans += bit[a];
return ans;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", a + i);
int ans = 0;
update(a[0]);
for (int i = 0; i < n;) {
int j = i++;
ans++;
while (i < n && query(a[i] - 1) <= query(a[j]) && a[i] >= a[i - 1]) i++;
for (int k = j; k < i; k++) update(a[k]);
}
printf("%d", ans);
return 0;
}
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... |