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

http://acm.hdu.edu.cn/showproblem.php?pid=4508

简单完全背包

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

const int N=100010;

using namespace std;
struct job{
    int value,w;
}node[N];

int n,m,dp[N];
int main(){
//    freopen("in.txt", "r", stdin);
    while(scanf("%d",&n) == 1){
        for(int i=1; i<=n; i++)
            scanf("%d%d",&node[i].value,&node[i].w);
        scanf("%d",&m);
        memset(dp, 0, sizeof(dp));
        for(int i=1; i<=n; i++){
            for(int j=node[i].w; j<=m; j++){
                dp[j] = max(dp[j], dp[j-node[i].w] + node[i].value);
            }
        }
        printf("%d\n",dp[m]);
    }
    return 0;
}