Submission #1172537

---

Source Code Expand

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

#define rep(i,n) for(int i=0; i<int(n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;

int A[100010];
int d[100010];

int main() {
	int N; cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> A[i];
		d[A[i]]++;
	}


	int p = 1,pos=0,ans=1;
	int sa = 0;
	while (1) {
		if (A[pos] == p && d[A[pos]]==1)p++;
		else if(d[A[pos]] != 1){
			d[A[pos]]--;
			sa++;
			pos++;
		}
		else
			pos++;
		if (pos == N && A[0] != N) ans++;
		if (pos == N)pos = 0;
		if (p == N-sa)break;

	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result