제출 #1266601

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1266601		g4yuhg	Global Warming (CEOI18_glo)	C++20	100 / 100	300 ms	18164 KiB

glo

//Huyduocdithitp
#include <bits/stdc++.h>
typedef long long ll;
#define pii pair<ll, ll> 
#define MP make_pair
#define fi first
#define se second
#define TASK "connect"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);
#define N 400005
#define LOG 18
#define endl '\n'
using namespace std;

ll n, x, a[N], b[N], m;
vector<ll> ns;

void pre() {
	sort(ns.begin(), ns.end());
	ns.resize(unique(ns.begin(), ns.end()) - ns.begin());
	for (int i = 1; i <= n; i ++) {
		a[i] = lower_bound(ns.begin(), ns.end(), a[i]) - ns.begin() + 1;
		b[i] = lower_bound(ns.begin(), ns.end(), b[i]) - ns.begin() + 1;
	}
}

ll st[4 * N], dp[2][N];

void update(ll id, ll l, ll r, ll i, ll v) {
	if (i > r || i < l) return;
	if (l == r) {
		st[id] = max(st[id], v);
		return;
	}
	ll mid = (l + r) / 2;
	update(id * 2, l, mid, i, v);
	update(id * 2 + 1, mid + 1, r, i, v);
	st[id] = max(st[id * 2], st[id * 2 + 1]);
}

ll get(ll id, ll l, ll r, ll L, ll R) {
	if (l > R || r < L) return 0;
	if (L <= l && r <= R) return st[id];
	ll mid = (l + r) / 2;
	return max(get(id * 2, l, mid, L, R), get(id * 2 + 1, mid + 1, r, L, R));
}

void build(ll id, ll l, ll r) {
	if (l == r) {
		st[id] = 0;
		return;
	}
	ll mid = (l + r) / 2;
	build(id * 2, l, mid);
	build(id * 2 + 1, mid + 1, r);
	st[id] = 0;
}

void solve() {
	ll ans = 0;
	m = ns.size();
	for (int i = n; i >= 1; i --) {
		ll mx = get(1, 1, m, b[i] + 1, m);
		dp[1][i] = mx + 1;
		update(1, 1, m, b[i], dp[1][i]);
	}
	build(1, 1, m);
	for (int i = n; i >= 1; i --) {
		ll mx = get(1, 1, m, a[i] + 1, m);
		dp[0][i] = mx + 1;
		update(1, 1, m, a[i], dp[0][i]);
		update(1, 1, m, b[i], dp[1][i]);
		ans = max(ans, dp[0][i]);
	}
	cout << ans;
}

signed main(void) {
	faster;
	
	cin >> n >> x;
	for (int i = 1; i <= n; i ++) {
		cin >> a[i];
		b[i] = a[i] + x;
		ns.push_back(a[i]);
		ns.push_back(b[i]);
	}
	pre();
	solve();
	
	return 0;
}

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