西瓜不懂柠檬的酸

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1237 这是单纯的本题答案； #include<stdio.h> #define N 1100 int main() { int a,j,i; double Sum[N],sum; char c1,c2, Read More

if(j>=w[i])dp[i][j] = max(dp[i-1][j-w[i]]+v[i], dp[i-1][j]);elsedp[i][j]=dp[i-1][j];i12345w12345v54321i代表前i件物品，j代表背包容量；i\dp\j0123456789100000000000001... Read More

2015-04-07http://acm.hdu.edu.cn/showproblem.php?pid=1312Sample Input 6 9....#......#..............................#@...#.#..#.11 9.#..........#.######... Read More