Submission #1607194

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <set>
#include <string>
#include <vector>
#include <array>

#define INT_MAX 2000000000
#define MOD 1000000007
#define ll long long;
#define REP(i,a,b) for(i = (a); i < (b); i++)
#define rep(i,n) REP(i,0,n)
#define bitget(a,b) (((a) >> (b)) & 1)

using namespace std;

int i, j, k;

int main()
{
	int n;
	int p[100001];
	cin >> n;
	REP(i, 1, n + 1){
		cin >> p[i];
	}
	int ans = 0;
	REP(i,1, n){
		if (p[i] == i){
			p[i] = p[i + 1];
			p[i + 1] = i;
			ans++;
		}
	}
	if (p[n] == n)ans++;
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result