Submission #169208

#	Time	Username	Problem	Language	Result	Execution time	Memory
169208		Trickster	Money (IZhO17_money)	C++14	0 / 100	2 ms	376 KiB

money

//Suleyman Atayew

#include <algorithm>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <vector>
#include <queue>
#include <cmath>
#include <map>
#include <set>

#define N 1000010
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define inf 1000000007
#define pii pair <int, int>

using namespace std;

int n;
int v[N];
set <int> S;

int main()
{
	cin >> n;
	
	int ans = 0;
	S.insert(1e9);
	for(int i = 1; i <= n; i++)
		cin >> v[i];
	
	for(int i = 1; i <= n; i++) {
		int h = i+1;
		int y = *S.lower_bound(v[i]);
		
		while(h <= n) {
			int x = *S.lower_bound(v[h]);
			
			if(x != y || v[h] < v[h-1]) break;
			
			h++;
		}
		
		for(int j = i; j < h; j++) S.insert(v[j]);
		
		ans ++;
		i = h-1;
	}
	
	cout << ans;
}

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