摘要： http://poj.org/problem?id=1276#include<iostream>#include<stdio.h>#include<string.h>const int N=120005;using namespace std;int v,n,num[N],val[N],dp[N];void zeropack(int c){ for(int i=v;i>=c;i--) dp[i]=max(dp[i],dp[i-c]+c);}void completepack(int c){ for(int i=c;i<=v;i++) dp[i]= 阅读全文