题目描述
有n个点,它们从1到n进行标号,第i个点的限制为度数不能超过A[i].
现在对于每个s (1 <= s <= n),问从这n个点中选出一些点组成大小为s的有标号无根树的方案数。
DP
prufer序DP裸上
#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
using namespace std;
typedef long long ll;
const int maxn=100+10,mo=1004535809;
int f[maxn][maxn][maxn*2],a[maxn],c[maxn*2][maxn];
int i,j,k,l,t,n,m,ans;
int main(){
freopen("tree.in","r",stdin);freopen("tree.out","w",stdout);
scanf("%d",&n);
fo(i,1,n) scanf("%d",&a[i]),a[i]=min(a[i],n),a[i]--;
c[0][0]=1;
fo(i,1,n){
c[i][0]=1;
fo(j,1,i) c[i][j]=(c[i-1][j]+c[i-1][j-1])%mo;
}
f[0][0][0]=1;
fo(i,0,n-1)
fo(k,0,n-1)
fo(j,0,n)
if (f[i][k][j]){
(f[i+1][k][j]+=f[i][k][j])%=mo;
fo(t,0,a[i+1]) (f[i+1][k+1][j+t]+=(ll)f[i][k][j]*c[j+t][t]%mo)%=mo;
}
fo(k,1,n){
if (k==1) ans=n;else ans=f[n][k][k-2];
(ans+=mo)%=mo;
printf("%d ",ans);
}
}