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, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;
int n, a[1000001], bit[1000001];
void update(int pos) {
for (; pos <= n; pos += (pos & (-pos))) bit[pos]++;
}
int query(int a, int b) {
int ans = 0;
for (b--; b; b -= (b & (-b))) ans += bit[b];
for (; a; a -= (a & (-a))) ans -= bit[a];
return ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
FOR(i, 0, n) cin >> a[i];
int ans = 1;
update(a[0]);
FOR(i, 1, n) {
int j = i++;
ans++;
while (i <= n) {
if (query(a[i], a[j]) > 0 || a[i] < a[i - 1]) break;
i++;
}
FOR(k, j, i) update(a[k]);
i--;
}
cout << ans;
return 0;
}
# | 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... |