题目:
经典题目改编,原题可以在洛谷上搜到
洛谷P1880 石子合并
考虑状态转移枚举所有情况,变成一道动规,考虑所有情况加和即可,代码(嫖的超简洁代码):
#include <bits/stdc++.h>
const int mod = 1000000007;
using namespace std;
const int N = 2010;
long long f[N],n,C[N][N], d[N];
void init() {
C[0][0] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = 0; j <= i; ++j) {
C[i][j] = C[i - 1][j];
if (j) C[i][j] = (C[i][j] + C[i - 1][j - 1]) % mod;
}
}
d[0] = 1;
for (int i = 1; i <= n; ++i) d[i] = d[i - 1] * i % mod;
}
int main() {
cin >> n;
init();
f[1] = 0;
for (int i = 2; i <= n; ++i) {
f[i] = 0;
for (int j = 1; j < i; ++j)
f[i] = (f[i] + C[i - 2][j - 1] * (f[j] * d[i - j - 1] % mod + f[i - j] * d[j - 1] % mod + i * d[i - j - 1] % mod * d[j - 1] % mod) % mod) % mod;
}
cout << f[n] << '\n';
return 0;
}