Submission #1654130

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<functional>
#include<string>

using namespace std;

typedef pair<int, int> P;
typedef pair<int, P> PP;
typedef long long ll;

int n;
vector<P> a;

int main()
{
	cin >> n;
	int ai;
	for (int i = 0; i < n; i++) {
		cin >> ai;
		a.push_back(P(ai, i + 1));
	}
	sort(a.begin(), a.end());

	int ans = 1;
	for (int i = 1; i < a.size(); i++) {
		if (a[i].second < a[i - 1].second)ans++;
	}
	if (a[a.size() - 1].second == 1)ans--;
	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result