제출 #927466

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
927466		OAleksa	Global Warming (CEOI18_glo)	C++14	0 / 100	2526 ms	262144 KiB

glo

#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define int long long
const int N = 2e5 + 69;
const int M = 30 * N;
const int inf = 1e9 + 69;
int n, a[N], x, dp[N];
int st[M], root[N], lc[M], rc[M];
int node;
void Modify(int v, int v1, int l, int r, int p, int x) {
	if (l == r)
		st[v] = max(st[v1], x);
	else {
		int mid = (l + r) / 2;
		if (p <= mid) {
			lc[v] = ++node;
			rc[v] = rc[v1];
			Modify(lc[v], lc[v1], l, mid, p, x);
		}
		else {
			rc[v] = ++node;
			lc[v] = lc[v1];
			Modify(rc[v], rc[v1], mid + 1, r, p, x);
		}
		st[v] = max(st[lc[v]], st[rc[v]]);
	}
}
int Get(int v, int tl, int tr, int l, int r) {
	if (tl > r || tr < l)
		return 0;
	else if (tl >= l && tr <= r)	
		return st[v];
	else {
		int mid = (tl + tr) / 2;
		return max(Get(lc[v], tl, mid, l, r), Get(rc[v], mid + 1, tr, l, r));
	}
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
	  cin >> n >> x;
	  for (int i = 1;i <= n;i++)
	  	cin >> a[i];
	  int ans = 1;
	  for (int i = n;i >= 1;i--) {
	  	root[i] = ++node;
	  	int x = Get(root[i + 1], 1, inf, a[i] + 1, inf) + 1;
	  	Modify(root[i], root[i + 1], 1, inf, a[i], x);
	  }
	  vector<int> dp(n, inf);
	  int s = 0;
	  auto Solve = [&](vector<int> a) {
	  	int r = 0;
	  	vector<int> dp(n, 1e9);
	  	for (int i = 0;i < n;i++) {
	  		auto u = lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
	  		if (dp[u] == 1e9) 
	  			r++;
	  		dp[u] = a[i];
	  	}
	  	return r;
	  };
	  for (int i = 1;i <= n;i++) {
	  	auto u = lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
	  	if (dp[u] == inf) 
	  		s++;
	  	dp[u] = a[i];
	  	int r = s + Get(root[i + 1], 1, inf, a[i] - x + 1, inf);
	  	vector<int> b;
	  	for (int j = 1;j <= n;j++)
	  		b.push_back(a[j]);
	  	for (int j = 1;j <= i;j++)
	  		b[j - 1] -= x;
	  	assert(Get(root[i + 1], 1, inf, a[i] - x + 1, inf) <= Solve(b) - s);
	  	ans = max(ans, r);
	  }
	  cout << ans << '\n';
  }
  return 0;
}

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