제출 #635400

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
635400		Morisz10	Global Warming (CEOI18_glo)	C++14	15 / 100	72 ms	3668 KiB

glo

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn = 200010;
 
int t[maxn], _end[maxn];
int dp[maxn];
 
int main()
{
	int n, x;
	cin >> n >> x;
	for (int i = 1; i <= n; i++) cin >> t[i];
	fill(dp, dp + n + 2, INT32_MAX);
	dp[0] = INT32_MIN;
	for (int i = 1; i <= n; i++) {
		int j = upper_bound(dp + 1, dp + n + 1, t[i]) - dp;
		if (dp[j - 1] < t[i] && t[i] < dp[j]) {
			dp[j] = t[i];
			_end[i] = j;
		}
		else {
			_end[i] = j - 1;
		}
	}
	fill(dp, dp + n + 2, INT32_MIN);
	dp[0] = INT32_MAX;
	int ans = 0;
	for (int i = n; i > 0; i--) {
		int l = 0, r = n + 1;
		while (l + 1 < r) {
			int m = (l + r) / 2;
			if (dp[m] > t[i] - x)l = m;
			else r = m;
		}
		ans = max(ans, _end[i] + l);
 
		l = 0, r = n + 1;
		while (l + 1 < r) {
			int m = (l + r) / 2;
			if (dp[m] > t[i])l = m;
			else r = m;
		}
		dp[l + 1] = t[i];
	}
	cout << ans << endl;
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 17
• Subtask 7: 0 / 25