# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
85538 | farukkastamonuda | Money (IZhO17_money) | C++14 | 1423 ms | 78748 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>
#define fi first
#define se second
#define mp make_pair
#define lo long long
#define inf 1000000000
#define md 1000000007
#define pb push_back
#define li 1000005
using namespace std;
lo int n,A[li],flag,tut=1,cev;
set<lo int> s;
int main(){
scanf("%lld",&n);
for(int i=1;i<=n;i++) scanf("%lld",&A[i]);
s.insert(inf);
//s.insert(0);
//~ s.insert(A[1]);
//~ for(int i=2;i<=n;i++){
//~ if(A[i]>=A[i-1]){
//~ s.insert(A[i]);
//~ tut=i;
//~ }
//~ else break;
//~ }
//~ lo int bas=1;
//if(bas<=n) cev++;
for(int i=1;i<=n;i++){
//~ printf("I :: %d CEV :: %d\n",i,cev);
cev++;
s.insert(A[i]);
auto it=s.upper_bound(A[i]);
while(i<n && A[i+1]>=A[i] && A[i+1]<=*it){
i++;
s.insert(A[i]);
}
}
printf("%lld\n",cev);
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... |