BNUOJ 51280 组队活动（dp + 计数）

题意:

给定编号为1∼N的N个人,至多M个人组成一队,M≤N≤1000,问组队方案数

两个组队方案被视为不同的，当且仅当存在至少一名队员在两种方案中有不同的队友

分析:

f[i]:=i个人的组队方案数(因为人是不同的)

f[0]=1,f[i]=∑j=0m−1Cji−1⋅f[i−1−j]

对于新添加进来的这个1个人,从前i−1个人中选出j个与他组队,方法数为Cji−1

剩余i−1−j个人的方法数为f[i−1−j],根据乘法原理每个j的贡献为Cji−1⋅f[i−1−j]

枚举j∈[0,m−1],加和到f[i]上

ans=f[n],时间复杂度为O(nm)

大数据要cdq分治ntt,贴个链接: 地址

代码:

//
//  Created by TaoSama on 2016-02-12
//  Copyright (c) 2016 TaoSama. All rights reserved.
//
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e3 + 10, INF = 0x3f3f3f3f, MOD = 998244353;

int n, m;
long long c

, f
;

int main() {
#ifdef LOCAL
freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0);

for(int i = 0; i <= 1000; ++i) {
c[i][0] = c[i][i] = 1;
for(int j = 1; j < i; ++j)
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % MOD;
}

int t; scanf("%d", &t);
while(t--) {
scanf("%d%d", &n, &m);
f[0] = 1;
for(int i = 1; i <= n; ++i) {
f[i] = 0;
for(int j = 0; j <= min(i - 1, m - 1); ++j) {
f[i] += c[i - 1][j] * f[i - 1 - j] % MOD;
f[i] %= MOD;
}
}
printf("%lld\n", f
);
}
return 0;
}