# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44281 | 2018-03-31T08:52:24 Z | Extazy | Money (IZhO17_money) | C++17 | 2 ms | 616 KB |
#include <bits/stdc++.h> #define endl '\n' using namespace std; const int N = 1000007; int n,a[N],it[N],ans; void update(int pos, int val) { for(;pos<N;pos+=pos&(-pos)) it[pos]+=val; } int query(int pos) { int ans=0; for(;pos>=1;pos-=pos&(-pos)) ans+=it[pos]; return ans; } int query(int l, int r) { return l>r ? 0 : query(r)-query(l-1); } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int i,j; scanf("%d", &n); for(i=1;i<=n;i++) { scanf("%d", &a[i]); } for(i=1;i<=n;i++) { ++ans; j=i; while(j+1<=n && a[j]<=a[j+1] && query(a[i]+1,a[j]-1)==0) { ++j; } for(;i<=j;i++) { update(a[i],1); } } printf("%d\n", ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 616 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 616 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 616 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 616 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |