제출 #169209

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
169209		Trickster	Money (IZhO17_money)	C++14	0 / 100	2 ms	404 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 <ll, ll>

using namespace std;

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

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