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>
using namespace std;
int a[1000005];
set<int> s;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, c=1, d=0;
cin >> n;
for (int i=1; i<=n; i++)
cin >> a[i];
s.insert(1e9);
while (c<=n)
{
int x=*s.upper_bound(a[c]);
s.insert(a[c++]);
while (c<=n && a[c-1]<=a[c] && a[c]<=x)
s.insert(a[c++]);
d++;
}
cout << d;
return 0;
}
# | 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... |