树形DP:
设 f [ u ] [ i ] f[u][i] f[u][i]表示给 u u u的子树分配工资, u u u点工资为 i i i的方案数
f [ u ] [ i ] = ∏ v ∈ s o n u ( ∑ j = 1 i f [ v ] [ j ] ) f[u][i]=\prod\limits_{v\in son_u}(\sum\limits_{j=1}^{i}f[v][j]) f[u][i]=v∈sonu∏(j=1∑if[v][j])
前缀和优化:
设 g [ u ] [ i ] = ∑ j = 1 i f [ u ] [ j ] g[u][i]=\sum\limits_{j=1}^{i}f[u][j] g[u][i]=j=1∑if[u][j]
f [ u ] [ i ] = ∏ v ∈ s o n u g [ v ] [ i ] f[u][i]=\prod\limits_{v\in son_u}g[v][i] f[u][i]=v∈sonu∏g[v]
[CF995F] Cowmpany Cowmpensation(树形dp,拉格朗日插值)
![](https://img-home.csdnimg.cn/images/20240711042549.png)