12 2011 档案
hdu 1561 The more, The Better
摘要:树形DP 此代码还可以优化ans[i][j] 代表以i节点的子树 攻j个城堡 的最优值详解见代码注释http://acm.hdu.edu.cn/showproblem.php?pid=1561#include<iostream>#include<string>#include<string.h>#include<queue>#include<math.h>#include<algorithm>#include<vector>#include<stdio.h>#define Max 0x7ffffff 阅读全文
posted @ 2011-12-08 13:04 夜-> 阅读(170) 评论(0) 推荐(0) 编辑
ural 1167. Bicolored Horses
摘要:ans[i][j]表示 第i个马厩放到第j只马时的最小不高兴值blacksum[i]表示到第i只马时的黑马数详解见代码注释http://acm.timus.ru/problem.aspx?space=1&num=1167#include<iostream>#include<string>#include<string.h>#include<queue>#include<math.h>#include<algorithm>#include<vector>#include<stdio.h>#de 阅读全文
posted @ 2011-12-02 16:49 夜-> 阅读(491) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示