本文主要是介绍HDU 2602 2018-1-29，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 72078 Accepted Submission(s): 29985
Problem Description
Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …
The bone collector had a big bag with a volume of V ,and along his trip of collecting there are a lot of bones , obviously , different bone has different value and different volume, now given the each bone’s value along his trip , can you calculate out the maximum of the total value the bone collector can get ?
The bone collector had a big bag with a volume of V ,and along his trip of collecting there are a lot of bones , obviously , different bone has different value and different volume, now given the each bone’s value along his trip , can you calculate out the maximum of the total value the bone collector can get ?
Input
The first line contain a integer T , the number of cases.
Followed by T cases , each case three lines , the first line contain two integer N , V, (N <= 1000 , V <= 1000 )representing the number of bones and the volume of his bag. And the second line contain N integers representing the value of each bone. The third line contain N integers representing the volume of each bone.
Followed by T cases , each case three lines , the first line contain two integer N , V, (N <= 1000 , V <= 1000 )representing the number of bones and the volume of his bag. And the second line contain N integers representing the value of each bone. The third line contain N integers representing the volume of each bone.
Output
One integer per line representing the maximum of the total value (this number will be less than 2 31).
Sample Input
1 5 10 1 2 3 4 5 5 4 3 2 1
Sample Output
14
# include <cstdio>
# include <cstdlib>
# include <cmath>
# include <cstring>
# include <string>
# include <iostream>
# include <iomanip>
# include <algorithm>
# include <stack>
# include <vector>
# include <queue>
using namespace std;
int max(int a, int b)
{return a>b ? a : b;
}
int main()
{int T, n, m, i, j;int a[1005], b[1005];scanf("%d", &T);while (T--){scanf("%d%d", &n, &m);for (i = 0; i<n; i++) scanf("%d", &a[i]);for (i = 0; i<n; i++) scanf("%d", &b[i]);int dp[1005]; memset(dp, 0, sizeof(dp)); for (i = 0; i<n; i++) for (j = m; j >= b[i]; j--)dp[j] = max(dp[j], dp[j - b[i]] + a[i]); printf("%d\n", dp[m]); }return 0;
}这篇关于HDU 2602 2018-1-29的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
