# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
36469 | 2017-12-09T09:18:03 Z | szawinis | Money (IZhO17_money) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; const int MAX = (1e6)+1; int n, ans, a[MAX], f[MAX]; vector<pair<int,int> > segs; void update(int i) { while(i < MAX) ++f[i], i += i & -i; } int query(int i) { int ret = 0; while(i > 0) ret += f[i], i -= i & -i; return ret; } int main() { scanf("%d",&n); int curr = 0; for(int i = 0; i < n; i++) { scanf("%d",a+i); if(i && a[i] < a[i-1]) { segs.emplace_back(curr, i-1); curr = i; } } segs.emplace_back(curr, n-1); for(auto p: segs) { int l, r; tie(l, r) = p; for(int i = l+1, last = l; i <= r; i++) if(query(a[i]-1) - query(a[l])) { while(last < i) update(last++); ++ans; } while(last <= r) update(last++); ++ans; } printf("%d", ans); }