제출 #879621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
879621		alex_2008	Money (IZhO17_money)	C++14	45 / 100	1549 ms	11940 KiB

money

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <unordered_set>
#include <cstdlib>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <bitset>
#include <queue>
#include <unordered_map>
#include <fstream>
#include <random>
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
const int N = 1e6 + 10;
int a[N], dp[N], down[N];
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	dp[0] = 0;
	dp[1] = 1;
	down[1] = 1;
	for (int i = 2; i <= n; i++) {
		down[i] = (a[i] < a[i - 1]) ? i : down[i - 1];
	}
	for (int i = 2; i <= n; i++) {
		int l = down[i], r = i;
		while (l <= r) {
			int mid = (l + r) / 2;			
			bool check = true;
			int R = 10000000;
			for (int j = 1; j < mid; j++) {
				if (a[j] > a[mid]) R = min(R, a[j]);
			}
			if (R < a[i]) check = false;
			if (check) {
				dp[i] = dp[mid - 1] + 1;
				r = mid - 1;
			}
			else l = mid + 1;
		}
	}
	cout << dp[n] << "\n";
}

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