树形dp
Lifel
dcoi 蒟蒻一枚 欢迎交流~~~qq:1627767186
展开
-
【bzoj1827】[Usaco2010 Mar]gather 奶牛大集会 树形dp+贪心
由x转移到y的答案为ans=ans+val∗(s[1]−s[y]∗2)ans=ans+val*(s[1]-s[y]*2) 可以看出只有s[1]−s[y]∗2<0s[1]-s[y]*2<0答案才会减小,所以贪心即可#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#inc原创 2017-09-13 20:13:22 · 457 阅读 · 0 评论 -
bzoj3631: [JLOI2014]松鼠的新家 树链剖分||树形dp
题目大意: 每次对一条链进行区间修改,最后询问每个点的点权树剖裸题,似乎dfs序也可以做?有时间再补#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#define fo(i,a,b) for(int i=a;i<=b;i++)#define fod(i,a,b) f原创 2017-09-13 21:24:57 · 513 阅读 · 0 评论 -
bzoj1131 树形dp
闲着无聊做水题2#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#define fo(i,a,b) for(int i=a;i<=b;i++)#define fod(i,a,b) for(int i=a;i>=b;i--)using namespace std;c原创 2017-09-08 22:04:40 · 351 阅读 · 0 评论