Submission #678918

#	Time	Username	Problem	Language	Result	Execution time	Memory
678918		YENGOYAN	Money (IZhO17_money)	C++17	100 / 100	971 ms	57988 KiB

money

/*
	//\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\\
	\\                                    //
	//  271828___182845__904523__53602__  \\
	\\  87___47____13______52____66__24_  //
	//  97___75____72______47____09___36  \\
	\\  999595_____74______96____69___67  //
	//  62___77____24______07____66__30_  \\
	\\  35___35____47______59____45713__  //
	//                                    \\
	\\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\//
												*/

#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_map>
#include <cmath>
#include <climits>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <iomanip>
#include <string>
#include <tuple>
#include <bitset>
#include <chrono>
#include <ctime>
#include <fstream>
#include <stack>
#include <cstdio>

using namespace std;
using ll = long long;
const int N = 3e5 + 5;
const ll mod = 1e9 + 7, inf = 1e12;

void solve() {
	// start time : 01:42
	int n; cin >> n;
	vector<int> v(n);
	for (int i = 0; i < n; ++i) cin >> v[i];
	int id = 1, cc = 1;
	set<int> st;
	st.insert(v[0]);
	for (int i = 1; i < n; ++i) {
		if (v[i] < v[i - 1]) {
			break;
		}
		id = i + 1;
		st.insert(v[i]);
	}
	int mn = v[0], mx = v[id - 1];
	while (id < n) {
		int ar = v[id];
		if (ar < mn) {
			++id;
			st.insert(ar);
			int aa = mn;
			mn = min(mn, ar);
			mx = max(mx, ar);
			while (id < n && v[id] <= aa && v[id] >= v[id - 1]) {
				mn = min(mn, v[id]);
				mx = max(mx, v[id]);
				st.insert(v[id]);
				++id;
			}
			++cc;
		}
		else if (ar >= mx) {
			++id;
			st.insert(ar);
			mx = max(mx, ar);
			mn = min(mn, ar);
			while (id < n && v[id] >= v[id - 1]) {
				st.insert(v[id]);
				mn = min(mn, v[id]);
				mx = max(mx, v[id]);
				++id;
			}
			++cc;
		}
		else {
			int iranicmec = *st.upper_bound(ar);
			mx = max(mx, ar);
			mn = min(mn, ar);
			st.insert(ar);
			++id;
			while (id < n && v[id] >= v[id - 1] && v[id] <= iranicmec) {
				st.insert(v[id]);
				mn = min(mn, v[id]);
				mx = max(mx, v[id]);
				++id;
			}
			++cc;
		}
	}
	cout << cc;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	//int t; cin >> t; 
	//while(t--) 
		solve();
}

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