HDU2602 Bone Collector

0/1背包

#include <iostream>

using namespace std;

int dp[1024][1024];
int val[1024];
int vol[1024];

int main()
{
    int t; 
    cin >> t;
    for (int i = 0; i < t; i++)
    {
        int n, V;
        cin >> n >> V;
        for (int j = 0; j < n; j++)
            cin >> val[j];
        for (int j = 0; j < n; j++)
            cin >> vol[j];
        for (int j = 1; j <= n; j++)
            for (int k = 0; k <= V; k++)
                dp[i][k] = 0;
        for (int j = 1; j <= n; j++)
        {
            for (int k = 0; k <= V; k++)
            {
                if (vol[j - 1] <= V)                   
                {
                    if (val[j - 1] + dp[j - 1][k - vol[j - 1]] > dp[j - 1][k] && k - vol[j - 1] >= 0)
                        dp[j][k] = val[j - 1] + dp[j - 1][k - vol[j - 1]];
                    else dp[j][k] = dp[j - 1][k];
                }
                else dp[j][k] = dp[j - 1][k];
            }
        }
        cout << dp[n][V] << endl;
    }
    return 0;
}