uoj 246 套路 (sqrt)

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

#define N 200020
#define LL long long
#define inf 0x3f3f3f3f

int n, m, k;
int a[N];
int dp[N];
int last[N], pos[N];

int main() {
	scanf("%d%d%d", &n, &m, &k);
	for(int i = 1; i <= n; ++i) {
		scanf("%d", &a[i]);
	}
	int B = max(sqrt(m), 2.0);
	LL ans = 0;
	for(int i = 1; i <= n; ++i) dp[i] = inf;
	for(int i = 2; i <= B; ++i) {
		for(int j = 1; j + i - 1 <= n; ++j) {
			dp[j] = min(dp[j], dp[j+1]);
			dp[j] = min(dp[j], abs(a[j] - a[j+i-1]));
			if(i >= k) ans = max(ans, 1LL * dp[j] * (i - 1));
		}
	}
	int len = (m - 1) / (B - 1);
	for(int i = 1; i <= n; ++i) {
		int r = 0;
		for(int j = 0; j < len; ++j) {
			r = max(r, last[a[i]+j]);
			if(a[i] - j > 0) r = max(r, last[a[i]-j]);
			r = max(r, pos[j]);
			if(i - r >= k) {
				ans = max(ans, 1LL * (j + 1) * (i - r - 1));
			}
			pos[j] = max(pos[j], r);
		}
		last[a[i]] = i;
	}
	printf("%lld\n", ans);
	return 0;
}