Submission #169789

#	Time	Username	Problem	Language	Result	Execution time	Memory
169789		super_j6	Money (IZhO17_money)	C++14	0 / 100	3 ms	508 KiB

money

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <stack>
using namespace std;
#define endl '\n'
#define pi pair<int, int>

const int maxn = 1000000;
int n;
pi a[maxn];
bool used[maxn];
stack<int> stk;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin >> n;
	
	for(int i = 0; i < n; i++){
		cin >> a[i].first;
		a[i].second = i;
	}
	
	sort(a, a + n);
	
	int ret = 0;
	for(int i = 0; i < n; i++){
		if(stk.empty() || !a[i].second || !used[a[i].second - 1]){
			stk.push(a[i].second);
			used[a[i].second] = 1;
		}else{
			while(stk.top() != a[i].second - 1){
				used[stk.top()] = 1;
				stk.pop();
				ret++;
			}
			used[stk.top()] = 0;
			stk.pop();
			stk.push(a[i].second);
			used[a[i].second] = 1;
		}
	}
	
	ret += stk.size();
	cout << ret << endl;

	return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 20
• Subtask 4: 0 / 55