标签：hdu4508

湫湫系列故事——减肥记I

3
3 3
7 7
9 9
10
5
1 1
5 3
10 3
6 8
7 5
6

10
20

完全背包入门题。

#include <stdio.h>
#include <string.h>

int dp[100002], w[102], v[102];

int main()
{
    int n, i, j, totalWeight;
    while(scanf("%d", &n) == 1){
        for(i = 1; i <= n; ++i)
            scanf("%d%d", &v[i], &w[i]);            
        scanf("%d", &totalWeight);
        memset(dp, 0, sizeof(dp));
        for(i = 1; i <= n; ++i){
            for(j = w[i]; j <= totalWeight; ++j){
                if(dp[j] < dp[j - w[i]] + v[i])
                    dp[j] = dp[j - w[i]] + v[i];
            }
        }
        printf("%d\n", dp[totalWeight]);
    }
    return 0;
}

HDU4508 湫湫系列故事——减肥记I 【完全背包】

标签：hdu4508

原文地址：http://blog.csdn.net/chang_mu/article/details/37991805