POJ 1276 完全背包

 1 #include<stdio.h>
 2 #include<iostream>
 3 using namespace std;
 4 
 5 #include<math.h>
 6 #include<algorithm>
 7 #include<string.h>
 8 #include<stdlib.h>
 9 #include<vector>
10 #include<set>
11 #include<map>
12 #include<stack>
13 #include<string>
14 #include<queue>
15 
16 #define repA(p,q,i)  for( int (i)=(p); (i)!=(q); ++(i) )
17 #define repAE(p,q,i)  for( int (i)=(p); (i)<=(q); ++(i) )
18 #define repD(p,q,i)  for( int (i)=(p); (i)!=(q); --(i) )
19 #define repDE(p,q,i)  for( int (i)=(p); (i)>=(q); --(i) )
20 
21 
22 int dismiss[] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048};
23 int ni[20], di[20];
24 int ci[110];
25 int dp[100010];
26 
27 int main()
28 {
29     int cash, n;
30     while( scanf("%d%d", &cash, &n) != EOF )
31     {
32            repA(0, n, i)
33              scanf("%d%d", &ni[i], &di[i]);
34            
35            int rd=0;
36            repA(0, n, i)
37            {
38                   int tmp = ni[i] + 1;
39                   int dt;
40                   for(dt = 1; dt < 11; ++dt)
41                   {
42                           if(tmp >= dismiss[dt])
43                             ci[rd++] = dismiss[dt-1] * di[i];
44                           else break;      
45                   }
46                   --dt;
47                   ci[rd++] = (ni[i] + 1 - dismiss[dt]) * di[i] ;
48            }
49            
50            memset(dp, 0, sizeof(dp) );
51            
52            repA(0, rd, i)
53              repDE(cash, ci[i], j)
54              dp[j] = max(dp[j], dp[j-ci[i] ] + ci[i] );
55            
56            printf("%d\n", dp[cash]);
57                                               
58                  
59     }
60     return 0;
61 }