CCC 2011 Unfriend
题面传送门
显然树形dpdpdp
转移时直接考虑这颗子树选或不选。dpv=dpv×(dpu+1)[u∈v]dp_v=dp_v\times (dp_u+1)[u∈v]dpv=dpv×(dpu+1)[u∈v]
代码实现:
#include<cstdio>
#define beg int cur=s.h[x]
#define end cur
#define go cur=tmp.z
using namespace std;
int n,m,k,x,y,z,dp[39],in[39];
struc
原创
2020-10-27 20:26:33 ·
106 阅读 ·
0 评论