# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
170472 | mcdx9524 | Money (IZhO17_money) | C++14 | 10 ms | 380 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;
typedef long long ll;
const int N = 1e6 + 7;
int t[N];
int upd(int p, int x) {
for (; p < N; p = (p | (p + 1))) {
t[p] += x;
}
}
int sum(int p) {
int res = 0;
for (; p >= 0; p = (p & (p - 1)) - 1) {
res += t[p];
}
return res;
}
int sum(int l, int r) {
if (l == 0) {
return sum(r);
} else {
return sum(r) - sum(l - 1);
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector <int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = 0;
int prv = 0;
for (int i = 1; i < n; i++) {
if (a[i] < a[i - 1] || sum(a[prv] + 1, a[i] - 1)) {
for (int j = i - 1; j >= prv; j--) {
upd(a[j], 1);
}
prv = i;
ans++;
}
}
cout << ans + 1 << '\n';
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... |