![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
树形dp
qq_30478929
这个作者很懒,什么都没留下…
展开
-
Anniversary party POJ - 2342
#include<iostream>#include<cstdio>#include<cstring>using namespace std;int vis[6003],father[6003],dp[6003][2],num;void dfs(int par){ vis[par]=1; for(int i=1;i<=num;i++) if(!vis[i]&&f原创 2017-03-06 18:53:25 · 172 阅读 · 0 评论 -
Strategic game POJ - 1463
#include<iostream>#include<cstdio>#include<cstring>using namespace std;int vis[1510],father[1510],dp[1510][2],num;void dfs(int node){ vis[node]=1; dp[node][1]=1; for(int i=0;i<num;i+原创 2017-03-06 19:34:46 · 189 阅读 · 0 评论 -
Tree Cutting POJ - 2378
#include<iostream>#include<cstdio>#include<cstring>#include<vector>#include<algorithm>using namespace std;int dp[10005][2],num;vector<int>p[10005]; vector<int>vec;void dfs(int node,int fa){原创 2017-03-06 21:12:09 · 212 阅读 · 0 评论 -
Godfather POJ - 3107
#include <iostream>#include <cstdio>#include <algorithm>#include <vector>#include <cstring>using namespace std;const int INF = 0x3f3f3f3f;const int MAXN = 50010;int tot[MAXN],f[MAXN], minx,size转载 2017-03-07 12:08:13 · 187 阅读 · 0 评论