Submission #1136330

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> P;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	vector<P> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i].first;
		a[i].second = i;
	}
	sort(a.begin(), a.end());
	if (binary_search(a.begin(), a.end(), P(a.back().first, 0))) {
		lower_bound(a.begin(), a.end(), P(a.back().first, 0))->second = n;
	}
	sort(a.begin(), a.end());
	int ans = 1, cur = 0;
	for (int i = 0; i < n; i++) {
		a[i].second %= n;
		if (cur > a[i].second) {
			if (a[i].second != 0 || i != n - 1) ans++;
		}
		cur = a[i].second;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result