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;
long long m[10000004];
set <long long> s;
int main()
{
long long n,i,pr=1e10,br=0;
cin>>n;
for(i=0;i<n;i++)cin>>m[i];
s.insert(pr);
for(i=0;i<n;i++)
{
pr=*s.upper_bound(m[i]);
s.insert(m[i]);
while(i<n-1 && m[i]<=m[i+1] && m[i+1]<=pr)
{s.insert(m[i+1]);i++;}
br++;
}
cout<<br<<endl;
}
# | 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... |