BZOJ1261: [SCOI2006]zh_tree
摘要:
题目:http://www.lydsy.com/JudgeOnline/problem.php?id=1261区间dp,f[l][r]=min(f[l][now-1]+f[now+1][r]+c*f[i]),然后最后再加上k*(sum[r]-sum[l-1])/sum[n]#include#incl... 阅读全文
posted @ 2015-12-11 21:52 ctlchild 阅读(492) 评论(0) 推荐(0) 编辑