제출 #166772

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
166772		Lightning	Money (IZhO17_money)	C++14	45 / 100	1560 ms	58116 KiB

money

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <stack>
#include <queue>
#include <deque>

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;

#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define show(a) cerr << #a <<" -> "<< a <<"\n"
#define fo(a, b, c, d) for(int (a) = (b); (a) <= (c); (a) += (d))
#define foo(a, b, c ,d) for(int (a) = (b); (a) >= (c); (a) -= (d))
//#define int ll

const int N = 2e6;

int n, a[N], cnt;
set <int> st;

int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	int l = 1;
	for(int r = 1; r <= n + 1; ++r) {
		if(a[r - 1] > a[r]) {
//			cerr << l <<" "<< r - 1 <<'\n'; 
			++cnt;
			for(int j = l; j <= r - 1; ++j)
				st.insert(a[j]);
			l = r;
			continue;
		}
		auto it = st.upper_bound(a[l]);
		if(it != st.end() && *it < a[r]) {
//			cerr << l <<" "<< r - 1 <<'\n';
			++cnt;
			for(int j = l; j <= r - 1; ++j)
				st.insert(a[j]);
			l = r;
		}
	}
	cout << cnt;
	return 0;
}
/*
	If you only do what you can do, 
	You will never be more than you are now!
	----------------------------------------
	We must all suffer from one of two pains: the pain of discipline or the pain of regret. 
	The difference is discipline weighs grams while regret weighs tons.
*/

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