标签:
Description
Input
Output
Sample Input
3
3 3
7 7
9 9
10
5
1 1
5 3
10 3
6 8
7 5
6
Sample Output
10
20
//显然这是一道 0 1 背包的水题
1 #include <stdio.h> 2 #include <string.h> 3 4 struct Food 5 { 6 int a,b; 7 }food[101]; 8 int dp[100005]; 9 10 int max(int a,int b) 11 { 12 return a>b?a:b; 13 } 14 15 int main() 16 { 17 int n,m; 18 int i,j; 19 while (scanf("%d",&n)!=EOF) 20 { 21 memset(dp,0,sizeof(dp)); 22 for (i=1;i<=n;i++) 23 scanf("%d%d",&food[i].a,&food[i].b); 24 scanf("%d",&m); 25 for (i=1;i<=n;i++) 26 { 27 for (j=food[i].b;j<=m;j++) 28 { 29 dp[j]=max(dp[j],dp[j-food[i].b]+food[i].a); 30 } 31 } 32 printf("%d\n",dp[m]); 33 } 34 return 0; 35 }
标签:
原文地址:http://www.cnblogs.com/haoabcd2010/p/5747384.html