摘要: 1051: [HAOI2006]受欢迎的牛Time Limit:10 SecMemory Limit:162 MBSubmit:3375Solved:1771[Submit][Status][Discuss]Description每一头牛的愿望就是变成一头最受欢迎的牛。现在有N头牛,给你M对整数(A... 阅读全文
posted @ 2015-12-11 22:12 albertxwz 阅读(186) 评论(0) 推荐(0) 编辑
摘要: Milk MeasuringHal BurchFarmer John must measure Q (1 #include #include using namespace std;int q, n, bv[105], need[105], maxd;bool f[20005];bool dp(in... 阅读全文
posted @ 2015-12-11 22:07 albertxwz 阅读(597) 评论(0) 推荐(0) 编辑
摘要: 1036: [ZJOI2008]树的统计CountTime Limit:10 SecMemory Limit:162 MBSubmit:9697Solved:3931[Submit][Status][Discuss]Description一棵树上有n个节点,编号分别为1到n,每个节点都有一个权值w。... 阅读全文
posted @ 2015-12-11 20:16 albertxwz 阅读(179) 评论(0) 推荐(0) 编辑