| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 697003 | allllekssssa | Money (IZhO17_money) | C++14 | 131 ms | 14948 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;
 
const int maxN = 1e6 + 10;
int a[maxN], bit[maxN];
int n;
void update(int x) {
	for (int i = x; i < maxN; i+=i&-i) {
		bit[i]++;
	}
}
int get(int x) {
	int ans = 0;
	for (int i = x; i > 0; i-=i&-i) {
		ans+=bit[i];
	}
	return ans;
}
void sredi(int l, int r) {
	for (int i = l; i <= r; i++) {
		update(a[i]);
	}
}
 
int main() {
 
	cin >> n;
 
	for (int i = 1; i<=n; i++) {
		scanf("%d", &a[i]);
	}
    
    int ans = 0;
    int pre = 0;
	for (int i = 1; i < n; i++) {
		if (i < n && a[i] > a[i + 1]) {
			++ans;
			sredi(pre + 1, i);
			pre = i;
			continue;
		}
        
		if (a[i] == a[i + 1]) continue;
        
        if (get(a[i + 1] - 1) - get(a[pre + 1]) > 0) {
        	++ans;
        	sredi(pre + 1, i);
        	pre = i;
        }
	}
 
	cout << ans + 1 << endl;
}
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... | ||||
