01背包问题
http://acm.hdu.edu.cn/showproblem.php?pid=2546
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 20416 Accepted Submission(s): 7139
1 50 5 10 1 2 3 2 1 1 2 3 2 1 50 0
-45 32
//dp500-9 #include <cstdio> #include <cstring> #include <algorithm> #include <queue> #include <map> #include <set> #include <stack> #include <string> #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 #define LL long long using namespace std; const int SIZE=1e3+10; int c[SIZE],dp[SIZE]; void Zero_One_pack(int c,int w,int sum){ for(int i=sum;i>=c;i--) dp[i]=max(dp[i],dp[i-c]+w); } int main() { int n,m; while(scanf("%d",&n)!=EOF){ if(n==0)break; for(int i=0;i<n;i++){ scanf("%d",&c[i]); } scanf("%d",&m); memset(dp,0,sizeof(dp)); if(m-5<0)printf("%d\n",m); else { m-=5; sort(c,c+n); for(int i=0;i<n-1;i++){ Zero_One_pack(c[i],c[i],m); } printf("%d\n",m+5-dp[m]-c[n-1]); } } return 0; }