HDU 2602 - Bone Collector

来源：互联网发布：glibc源码编辑：程序博客网时间：2024/05/29 17:57

0-1背包裸题，终于把它理解了~

从局部最优解推出全局最优解。

详细参考这个讲解：http://www.tuicool.com/articles/yuqUreB

#include <stdio.h>#include <string.h>#include <math.h>#include <stdlib.h>#include <algorithm>#include <iostream>#include <set>#include <map>#include <queue>#include <stack>#include <assert.h>#include <malloc.h>typedef long long LL;using namespace std;int dp[1001][1001];int main(){    //freopen("test0.in", "r", stdin);    //freopen("test0.out", "w", stdout);    int T, N, M, v[1000], w[1000];    scanf("%d", &T);    while(T--)    {        scanf("%d %d", &N, &M);        for(int i = 0; i < N; i++)        {            scanf("%d", &w[i]);        }        for(int i = 0; i < N; i++)        {            scanf("%d", &v[i]);        }        memset(dp, 0, sizeof(dp));        for(int i = 1; i <= N; i++)        {            for(int C = 0; C <= M; C++)            {                dp[i][C] = dp[i-1][C];                if(C >= v[i-1])                {                    dp[i][C] = max(dp[i][C], dp[i-1][C-v[i-1]] + w[i-1]);                }            }        }        printf("%d\n", dp[N][M]);    }    return 0;}

0 0