# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
85413 | ToadDaveski | Money (IZhO17_money) | C++14 | 3 ms | 660 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 ll long long
using namespace std;
set <ll> st;
ll a[1000001];
int main()
{
ll n,m,i,j,ans=0;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
st.insert(10000000);
for(i=1;i<=n;i++)
{
ans++;
st.insert(a[i]);
while(i<n && a[i+1]>=a[i] && a[i+1]<=(*st.upper_bound(a[i])))
{
st.insert(a[i+1]);
i++;
}
}
cout<<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... |