# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
171386 | juggernaut | Money (IZhO17_money) | C++14 | 1521 ms | 61928 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.
//Just try and the idea will come!
#include<bits/stdc++.h>
#define int long long int
using namespace std;
set<int>st;
int mx,n,i,a[1000001],ans;
main(){
st.insert(1e15);
scanf("%lld",&n);
for(i=0;i<n;i++)scanf("%lld",&a[i]);
i=0;
while(i<n){
mx=*st.upper_bound(a[i]);
st.insert(a[i]);
while(i+1<n&&a[i]<=a[i+1]&&a[i+1]<=mx)i++,st.insert(a[i]);
i++;
ans++;
}
printf("%lld",ans);
}
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... |