『计数DP优化』CF626F Group Projects

$\mathrm{P}\mathrm{r}\mathrm{o}\mathrm{b}\mathrm{l}\mathrm{e}\mathrm{m}$

There are $n$ students in a class working on group projects. The students will divide into groups (some students may be in groups alone), work on their independent pieces, and then discuss the results together. It takes the $i$ -th student $a_i$ minutes to finish his/her independent piece.

If students work at different paces, it can be frustrating for the faster students and stressful for the slower ones. In particular, the imbalance of a group is defined as the maximum $a_i$ in the group minus the minimum $a_i$ in the group. Note that a group containing a single student has an imbalance of $0$ . How many ways are there for the students to divide into groups so that the total imbalance of all groups is at most $k$ ?

Two divisions are considered distinct if there exists a pair of students who work in the same group in one division but different groups in the other.

---

$\mathrm{S}\mathrm{o}\mathrm{l}\mathrm{u}\mathrm{t}\mathrm{i}\mathrm{o}\mathrm{n}$

这道题，我们首先想到排序，对于一个数字我们可以分成 $4$ 类：贡献为 $-1$ 的最小值，贡献为 $1$ 的最大值，贡献为 $0$ 的中间值或单独一组。

我们我们设 $f(i,j,k)$ 表示前 $i$ 个数，有 $j$ 组数需要求出最大值，和为 $k$ 的方案。

• 当前数为最小值时，贡献为$f(i-1,j-1,k+a_i)$。
• 当前数为最大值时，贡献为$f(i-1,j+1,k-a_i)\times (j+1)$，表示$j+1$个组任意挑选一个组来进行结尾。
• 当前数为中间值时，贡献为$f(i-1,j,k)\times j$。
• 当前数单独为一组时，贡献为$f(i-1,j,k)$。

我们发现第三维难以处理，考虑优化。

我们发现对于$[l,r]$的贡献，可以简化为${\sum }_{i=l+1}^r{a}_i-a_{i-1}$，那么我们只要对差分进行求和即可。对于每一组没有结尾的或者刚好结尾的，我们加上这个差分值。

然后就简化成了：$$\begin{gathered} f(i,j,k)=f(i-1,j-1,k-(j-1)△) \\ +(j+1)\times f(i-1,j+1,k-(j+1)△)+ \\ j\times f(i-1,j,k-j△)+f(i-1,j,k-j△) \end{gathered}$$
答案是$\sum f(n,0,i)(i\le m)$。

---

$\mathrm{C}\mathrm{o}\mathrm{d}\mathrm{e}$

#include <bits/stdc++.h>
#define f(a, b, c) f[a][b][c]
#define update(a, b) a = (a + b) % P

using namespace std;
const int P = 1e9 + 7;
const int N = 210;
const int K = 1010;

int n, m;
int a[N], f[N][N][K];

int read(void)
{
	int s = 0, w = 0; char c = getchar();
	while (!isdigit(c)) w |= c == '-', c = getchar();
	while (isdigit(c)) s = s*10+c-48, c = getchar();
	return w ? -s : s;
}

signed main(void)
{
	n = read(), m = read();
	for (int i=1;i<=n;++i) a[i] = read();
	sort(a+1, a+n+1);
	f[0][0][0] = 1;
	for (int i=1;i<=n;++i) {
		for (int j=0;j<=i;++j) {
			int val = a[i] - a[i-1];
			for (int k=0;k<=m;++k) {
				if (k - j * val >= 0) update(f(i, j, k), f(i-1, j, k - j * val));
				if (k - j * val >= 0) update(f(i, j, k), 1LL * f(i-1, j, k - j * val) * j % P);
				if (j > 0 and k - (j-1) * val >= 0) update(f(i, j, k), f(i-1, j-1, k-(j-1)*val));
				if (j < n and k - (j+1) * val >= 0) update(f(i, j, k), 1LL * f(i-1, j+1, k-(j+1)*val) * (j+1) % P); 
			}
		}
	}
	int res = 0; 
	for (int i=0;i<=m;++i) update(res, f(n, 0, i));
	cout << res << endl;
	return 0;
}