树形dp
kaqiur
从零到一
展开
-
oldssoj2668Bombing plan(树形dp)
题目描述Kingdom Y is in the war with kingdom X. Kingdom X consists of N cities,there are N-1 bidirectional roads which are all 1 long ,each of them connect a pair of cities,the N cities are all conn原创 2015-08-27 21:59:02 · 365 阅读 · 0 评论 -
二叉苹果树(树形D)
#include #include #include #include #define maxn 302#define inf 10000007using namespace std;struct data{ int x,y,z;};data lin[maxn*2];int n,d[maxn],f[maxn][maxn],q,tot[maxn],nxt[maxn*2],原创 2016-08-03 14:47:09 · 855 阅读 · 0 评论 -
树形DP
http://www.cnblogs.com/gq-ouyang/archive/2013/02/26/2933431.html转载 2016-08-02 13:17:02 · 325 阅读 · 0 评论