Alitaulukot

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int N = 1 << 17;
ll dp[N];
ll d[2*N][2];

void change(int k, ll x) {
	k += N;
	d[k][0] = x;
	d[k][1] = x;
	for (k /= 2; k >= 1; k /= 2) {
		d[k][0] = min(d[k*2][0], d[k*2+1][0]);
		d[k][1] = max(d[k*2][1], d[k*2+1][1]);
	}
}

ll mn(int a, int b) {
	a += N;
	b += N;

	ll m = 1e18;
	while (a <= b) {
		if (a % 2 == 1) m = min(m, d[a++][0]);
		if (b % 2 == 0) m = min(m, d[b--][0]);
		a /= 2;
		b /= 2;
	}
	return m;
}

ll mx(int a, int b) {
	a += N;
	b += N;

	ll m = 0;
	while (a <= b) {
		if (a % 2 == 1) m = max(m, d[a++][1]);
		if (b % 2 == 0) m = max(m, d[b--][1]);
		a /= 2;
		b /= 2;
	}
	return m;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int n, k;
	cin >> n >> k;

	vector<ll> v(n);
	for (int i = 0; i < n; ++i) cin >> v[i];
	for (int i = 0; i < n; ++i) change(i, v[i]);

	for (int i = 0; i <= n; ++i) {
		if (i == n || mx(0, i)-mn(0, i) > k) {
			dp[0] = i;
			break;
		}
	}

	ll r = dp[0];

	for (int a = 1; a < n; ++a) {
		for (int b = a+dp[a-1]-1; b <= n; ++b) {
			if (b == n || mx(a, b) - mn(a, b) > k) {
				dp[a] = b-a;
				r += dp[a];
				break;
			}
		}
	}
	cout << r << '\n';
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED

Test 17

Group: 3

Verdict: ACCEPTED