# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
493545 | reni | Money (IZhO17_money) | C++14 | 1146 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.
#include<iostream>
#include<set>
using namespace std;
set<long long>st;
long long b[1000003];
int main()
{
long long br=0,n,i,j,a,pr=-1,maxi=-1;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a;
b[i]=a;
}
st.insert(b[0]);
st.insert(100000000);
for(j=0;j<n;)
{
auto it=st.upper_bound(b[j]);
j++;st.insert(b[j]);
while(b[j]>=b[j-1] && b[j]<=*it)
{
j++;st.insert(b[j]);
}
br++;
}
cout<<br<<endl;
}
/*
6
3 6 4 5 1 2
*/
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... |