Submission #973586

#	Time	Username	Problem	Language	Result	Execution time	Memory
973586		TAhmed33	Global Warming (CEOI18_glo)	C++98	58 / 100	136 ms	10156 KiB

glo

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 25;
#define mid ((l + r) >> 1)
#define tl (node + 1)
#define tr (node + 2 * (mid - l + 1))
struct BIT {
	int tree[MAXN];
	void update (int a, int b) {
		for (; a < MAXN; a += a & (-a)) tree[a] = max(tree[a], b);
	}
	int get (int x) {
		int ret = 0;
		for (; x > 0; x -= x & (-x)) ret = max(ret, tree[x]);
		return ret;
	}
} cur[2];
int n, x, a[MAXN], dp[MAXN][2];
vector <int> comp;
int f (int x) {
	return lower_bound(comp.begin(), comp.end(), x) - comp.begin();
}
void solve () {
	cin >> n >> x;
	for (int i = 1; i <= n; i++) cin >> a[i];
	comp.push_back(-1e9); comp.back()--;
	for (int i = 1; i <= n; i++) {
		comp.push_back(a[i]);
		comp.push_back(a[i] - x);
	}
	sort(comp.begin(), comp.end());
	comp.resize(unique(comp.begin(), comp.end()) - comp.begin());
	int u = comp.size();
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		dp[i][0] = cur[0].get(f(a[i] - x) - 1) + 1;
		dp[i][1] = max(cur[0].get(f(a[i]) - 1), cur[1].get(f(a[i]) - 1)) + 1;
		cur[0].update(f(a[i] - x), dp[i][0]);
		cur[1].update(f(a[i]), dp[i][1]);
		ans = max({ans, dp[i][0], dp[i][1]});
	}
	cout << ans << '\n';
}
signed main () {
	ios::sync_with_stdio(0); cin.tie(0);
	int t = 1; //cin >> t;
	while (t--) solve();
}

Compilation message (stderr)

glo.cpp: In function 'void solve()':
glo.cpp:33:6: warning: unused variable 'u' [-Wunused-variable]
   33 |  int u = comp.size();
      |      ^

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