【计数】tower

看了题解完全觉得是sb题。。。那么 = =作为一个sb题都做不来的。。。

设dp[i] 为前i 个的方案数，那么枚举所有能在上面放i 的积木j，就会对答案带来dp[i - 1]的贡献。

#include <cstdio>
#include <iostream>
#include <algorithm>

using namespace std;

int read()
{
	int n = 0, sign = 1; char c = getchar();
	while(c < '0' || c > '9') {if(c == '-') sign = -1; c = getchar(); }
	while(c >= '0' && c <= '9') { n = n*10 + c-'0'; c = getchar(); }
	return n * sign;
}

const int Mod = 998244353;

int N, D;
int a[700005];
int ans;

int main()
{
	freopen("tower.in", "r", stdin);
	freopen("tower.out", "w", stdout);
	
	N = read(), D = read();
	for (int i = 1; i <= N; ++i) a[i] = read();
	sort(a + 1, a + N + 1); ans = 1;
	
	for (int i = 2, j = 1; i <= N; ++i) {
		while (a[j] + D < a[i]) ++j;
		ans = 1ll * ans * (i - j + 1) % Mod;
	}
	
	printf("%d\n", ans);
	
	return 0;
}