# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
361250 | MilosMilutinovic | Money (IZhO17_money) | C++14 | 199 ms | 15152 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 N=1000050;
int n,a[N],bit[N];
int Get(int x){int res=0;for(;x>0;x-=x&(-x))res+=bit[x];return res;}
void Add(int x){for(;x<N;x+=x&(-x))bit[x]++;}
int main(){
scanf("%i",&n);
for(int i=1;i<=n;i++)scanf("%i",&a[i]);
int j=1,ans=1;
for(int i=2;i<=n;i++){
if(a[i]<a[i-1]||Get(a[i]-1)>Get(a[j])){
ans++;
while(j<i)Add(a[j]),j++;
}
}
printf("%i",ans);
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... |