33,027
社区成员




int knapsack(int n)
{
for(int i = 1 ; i <= n ; i ++){
for(int j = 1; j <= weightsum ; j ++){
if(weight[i] <= j)
data[i][j] = max(data[i-1][j] , data[i-1][j-weight[i]] + value[i]);
else
data[i][j] = data[i-1][j];
}
}
return data[n][weightsum];
}