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;
const int inf=1e9, nx=1e6+5;
int n, v[nx], l, idx, dp[nx];
set<int> s;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n;
s.insert(1e9);
for (int i=1; i<=n; i++)
{
cin>>v[i];
//cout<<i<<' '<<v[i]<<' '<<l<<'\n';
if (v[i]>=v[i-1]&&v[i]<=l)
{
dp[i]=dp[idx]+1;
}
else
{
while (idx<i) s.insert(v[idx]), idx++;
l=*s.upper_bound(v[i]);
idx=i-1;
dp[i]=dp[i-1]+1;
}
//cout<<"here"<<' '<<dp[i]<<'\n';
}
cout<<dp[n];
}
# | 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... |