Submission #2832633

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
int n,a[200005],pos[200005],num[200005];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		pos[a[i]] = i;
	}
	int pre = -1,nxt = 0;
	for(int i=1;i<=n;i++){
		if(pre < pos[i]){
			pre = pos[i];
			num[pos[i]] = nxt;
		}
		else{
			nxt++;
			pre = pos[i];
			num[pos[i]] = nxt;
		}
	}
	int cur = nxt;
	for(int i=1;i<=n;i++){
		if(num[i] == cur){
			cur--;
			if(cur == -1 && a[i] == 1){
				cout<<nxt<<endl;
				return 0;
			}
		}
	}
	cout<<nxt+1<<endl;
}

Submission Info

Judge Result