u012766950的专栏

由于这两个题目有递进关系所以把他们写在一个博客里面，希望对各位有帮助！ http://acm.hdu.edu.cn/showproblem.php?pid=2391 输入： 1 3 4 1 10 8 8 0 0 1 8 0 27 0 4 输出： Scenario #1: 42 题目大意：就是从一个矩阵的左上角走到它的右下角，矩阵的每一个元素都有一个非0值，只有三个方向可以走

http://acm.hdu.edu.cn/showproblem.php?pid=1029 Ignatius and the Princess IV Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32767 K (Java/Others) Total Submission(s): 16754    Accepte

http://acm.hdu.edu.cn/showproblem.php?pid=1069 Monkey and Banana Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7397    Accepted Submissi

http://acm.hdu.edu.cn/showproblem.php?pid=1087 Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 21884    A

http://acm.hdu.edu.cn/showproblem.php?pid=1003 Max Sum Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 142781    Accepted Submission(s): 3

http://acm.hdu.edu.cn/showproblem.php?pid=1176 免费馅饼 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 25157    Accepted Submission(s): 852

01背包问题： 有一个体积为V的背包，有n件物品，每件物品的体积，价值分别为w[i],p[i];要从n件物品中选些放入背包中，使背包里物品的总价值最大。 动态方程：c[i][j]=max(c[i-1][j],c[i-1][j-w[i]]+p[i]). 有关动态方程方面的代码： for (int i = 1; i <= n; i++) { for (int j = 1; j