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;
const int N = 1e6 + 100;
int n;
int a[N], cnt, ans = 1;
set < int > st;
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
st.insert(1111111);
for (int i = 1; i <= n; i++){
set < int > :: iterator lw;
lw = st.upper_bound(a[i - cnt]);
if(*lw >= a[i] && a[i] >= a[i - 1])
cnt++;
else{
ans++;
for (int j = i - cnt; j < i; j++)
st.insert(a[j]);
cnt = 1;
}
}
cout << ans;
}
# | 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... |