随笔分类 -  ACM__动态规划

摘要：http://acm.sdibt.edu.cn/JudgeOnline/problem.php?id=4807 dp[i][j]表示前i个元素形成的集合的子集的和能否为j 如果dp[i-1,j] = 1或者dp[i-1,j-a[i]] = 1,则dp[i,j] =1. 每一行都是由他的前一行得到的 阅读全文

摘要：Adjacent Bit Counts 4557 Adjacent Bit CountsFor a string of n bits x 1 , x 2 , x 3 ,..., x n , the adjacent bit count of the string (AdjBC(x)) is give 阅读全文

摘要：4554 BallsThe classic Two Glass Balls brain-teaser is often posed as:“Given two identical glass spheres, you would like to determine the lowest floor 阅读全文