多个人独立的01背包,最后把各个独立的dp结果加起来就行了
#include <stdio.h>
#include <stdlib.h>
struct obj_node{
int value;
int weight;
};
struct obj_node obj_arr[1001];
int *bag_arr;
int func(int obj_n, int bag_size){
int i, j, temp;
int dp[35];
for(j=0; j<=30; j++) dp[j] = 0;
for(i=1; i<=obj_n; i++){
for(j=bag_size; j>=0; j--){
if(j>=obj_arr[i].weight){
temp = dp[j-obj_arr[i].weight] + obj_arr[i].value;
if(temp > dp[j])
dp[j] = temp;
}
}
}
return dp[bag_size];
}
int main(void){
int case_n, obj_n, bag_n;
int i, sum;
//freopen("input.dat", "r", stdin);
scanf("%d", &case_n);
while(case_n--){
scanf("%d", &obj_n);
for(i=1; i<=obj_n; i++)
scanf("%d %d", &(obj_arr[i].value), &(obj_arr[i].weight));
scanf("%d", &bag_n);
bag_arr = (int*)malloc(sizeof(int)*(bag_n+1));
sum = 0;
for(i=1; i<=bag_n; i++){
scanf("%d", bag_arr+i);
sum += func(obj_n, bag_arr[i]);
}
printf("%d\n", sum);
free(bag_arr);
}
return 0;
}