Bone Collector

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

Bone Collector 递归做法

 

//Bone Collector   递归做法
#include<stdio.h>
#define N 1005
#define V 1005
int c[N][V];
int value[N];
int size[N];
int knapsack(int n, int volume)
{
    int temp1,temp2;
    if (n <= 0 || volume < 0)
        return 0;
    if (c[n][volume] != -1)   //已经计算过c[n][volum]，就直接返回
        return c[n][volume];
    temp1 = knapsack(n - 1, volume);  //第n个不装进包里
    if (volume < size[n])
        temp2 = -1;   //第n个的体积比剩下的要大，装不进去
    else
        temp2 = knapsack(n - 1, volume - size[n]) + value[n];   //将第n个装进包里，同时其体积也变为volume-size[n].继续递归
    if (temp1 > temp2)
        c[n][volume] = temp1;
    else
        c[n][volume] = temp2;
    return c[n][volume];
}

void main()
{
    int t;
    int n,v;
    int temp, i, j;
//  freopen("input.txt", "r", stdin);
    scanf("%d", &t);
    while (t--)
    {
        scanf("%d%d", &n, &v);
        for (i = 1; i <= n; i++)
        {
            scanf("%d", &value[i]);
        }
        for (i = 1; i <= n; i++)
        {
            scanf("%d", &size[i]);
        }
        //初始化
        for (i = 1; i <= n; i++)
        {
            for (j = 0; j <= v; j++)
            {
                c[i][j] = -1;
            }
        }
        temp = knapsack(n, v);
        printf("%d\n",temp);
    }
}