**Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26534 Accepted Submission(s): 9332 **
Problem Description
Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don’t know that Computer College had ever been split into Computer College and Software College in 2002. The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All facilities must go halves. First, all facilities are assessed, and two facilities are thought to be same if they have the same value. It is assumed that there is N (0<N<1000) kinds of facilities (different value, different kinds).
Input
Input contains multiple test cases. Each test case starts with a number N (0 < N <= 50 – the total number of different facilities). The next N lines contain an integer V (0<V<=50 –value of facility) and an integer M (0<M<=100 –corresponding number of the facilities) each. You can assume that all V are different. A test case starting with a negative integer terminates input and this test case is not to be processed.
Output
For each case, print one line containing two integers A and B which denote the value of Computer College and Software College will get respectively. A and B should be as equal as possible. At the same time, you should guarantee that A is not less than B.
Sample Input
2 10 1 20 1 3 10 1 20 2 30 1 -1
Sample Output
20 10 40 40
背包。
所有的设备不是放在第一部分，就是要放在第二部分。
那么对于第一部分，或者第二部分，每一个设备就只有放和不放两种情况。
然后感觉就是做一个容量为总数的一半的01背包
然后脑抽看到第一部分可以大于一半，觉得这么想是错的。。。
实际上并不是，因为第二部分总要比第一部分小，所以第二部分是不可能大于一半的。
所以我们对于第二部分做01背包。
代码实现
1
2 /* ***********************************************
3 Author :111qqz
4 Created Time :2016年02月22日 星期一 22时52分26秒
5 File Name :code/hdu/1171.cpp
6 ************************************************ */
7
8 #include <iostream>
9 #include <algorithm>
10 #include <cstring>
11 #include <cstdio>
12 #include <cmath>
13
14 using namespace std;
15 const int N=3E6+5;
16 int a[N],dp[N];
17 int n,x,y;
18 int tmp;
19 int sum;
20
21 void solve(int value ,int cost)
22 {
23 for ( int i = sum/2 ; i >= cost ; i--)
24 {
25 dp [i] = max(dp[i],dp[i-cost]+value);
26 }
27
28 }
29
30 int main()
31 {
32 while (scanf("%d",&n)!=EOF)
33 {
34 if( n<0 ) break;
35 memset(dp,0,sizeof(dp));
36 memset(a,0,sizeof(a));
37 tmp = 1;
38 sum = 0;
39 for ( int i = 1 ; i <= n ; i++ )
40 {
41 scanf("%d %d",&x,&y);
42 sum = sum +x*y;
43 for ( int j =1 ; j <= y ; j++)
44 {
45 a[tmp] = x;
46 tmp++;
47 }
48 }
49 for ( int i = 1 ; i <= tmp ; i++)
50 solve (a[i],a[i]);
51 printf("%d %d\n",sum-dp[sum/2],dp[sum/2]);
52 }
53
54 return 0;
55 }还有一种母函数的做法：先得到每种价值有多少种方案，然后从总价值一半向下找到第一个方案数非 0 的价值，就是答案。#
注意。。。数组开小不一定是 re…tle,wa,re 都有可能
代码实现
1
2
3 /* ***********************************************
4 Author :111qqz
5 Created Time :2016年02月25日 星期四 23时08分48秒
6 File Name :code/hdu/_1171.cpp
7 ************************************************ */
8
9 #include <cstdio>
10 #include <cstring>
11 #include <iostream>
12 #include <algorithm>
13 #include <vector>
14 #include <queue>
15 #include <set>
16 #include <map>
17 #include <string>
18 #include <cmath>
19 #include <cstdlib>
20 #include <ctime>
21 #define fst first
22 #define sec second
23 #define lson l,m,rt<<1
24 #define rson m+1,r,rt<<1|1
25 #define ms(a,x) memset(a,x,sizeof(a))
26 typedef long long LL;
27 #define pi pair < int ,int >
28 #define MP make_pair
29
30 using namespace std;
31 const double eps = 1E-8;
32 const int dx4[4]={1,0,0,-1};
33 const int dy4[4]={0,-1,1,0};
34 const int inf = 0x3f3f3f3f;
35 const int N=3E5+7;
36 int n;
37 int a[N],tmp[N];
38 int v[55],num[55];
39 int main()
40 {
41 #ifndef ONLINE_JUDGE
42 freopen("code/in.txt","r",stdin);
43 #endif
44
45 while (scanf("%d",&n))
46 {
47 if (n<0) break;
48
49 for ( int i = 1 ; i <= n ; i++)
50 {
51 scanf("%d %d",&v[i],&num[i]);
52 }
53
54 ms(a,0);
55 for ( int i = 0 ; i <= num[1]*v[1] ; i+=v[1])
56 {
57 a[i] = 1;
58 }
59
60 int cur = num[1]*v[1];
61 for ( int i = 2 ; i <= n ; i++)
62 {
63 for ( int j = 0 ; j <= cur ; j++)
64 {
65 for ( int k = 0 ; k<=num[i]*v[i] ; k +=v[i] )
66 {
67 tmp[j+k] += a[j];
68 }
69 }
70
71 cur += num[i]*v[i];
72
73 for ( int j = 0 ; j <= cur ; j++)
74 {
75 a[j] = tmp[j];
76 tmp[j] = 0 ;
77 }
78 }
79
80 for ( int i = cur/2 ; i >= 0 ; i--)
81 {
82 if (a[i]!=0)
83 {
84 printf("%d %d\n",cur-i,i);
85 break;
86 }
87 }
88 }
89
90 #ifndef ONLINE_JUDGE
91 fclose(stdin);
92 #endif
93 return 0;
94 }