Submission #1655677

---

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;

	int i = 1;
	int cur_r = a[0].second;
	while (i < a.size()) {
		if (a[i].first == a[i - 1].first) {
			cur_r = a[i].second;
			i++;
		}
		else {
			if (a[i].second > cur_r) {
				cur_r = a[i].second;
				i++;
			}
			else {
				int k = i;
				int ope = 0;
				while (k<a.size()&&a[k].first == a[i].first) {
					if (a[k].second > cur_r) {
						ope = 1;
						cur_r = a[k - 1].second;
						break;
					}
					else k++;
				}
				if (ope == 0) {
					ans++;
					cur_r = a[k - 1].second;
					i = k;
				}
				else {
					ans++;
					while (k<a.size()) {
						if (a[k].first != a[k - 1].first) {
							i = k;
							break;
						}
						else k++;
					}
					i = k;
				}
			}
		}
	}
	if (cur_r== 1)ans--;
	cout << ans << endl;
	/*
	int i=1;
	while (i < a.size()) {
		if (a[i].first > a[i - 1].first) {
			if (a[i].second > a[i-1].second)i++;
			else {
				while (1) {
					if (a[i + 1].first > a[i].first)ans++;
					else {

					}
				}
			}
		}
		if (a[i].second > a[i - 1].second) {
			if (a[i].first > a[i - 1].first);
		}
	}

	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--;
	*/
	

	return 0;
}

Submission Info

Judge Result