hdu 1171 普通母函数

题目传送门：点击打开链接

我觉得这题只要的难点在于怎么想用母函数来做这题，如果知道用母函数那么就可以用模版把所有的可能值都列出来，然后在暴力寻找就能ac了。如果还不能ac我觉得有可能你没有注意到是负数结束，不是－1结束。题目中既然说sum／2，所以我们可以枚举sum／2就可以了。。

#include <iostream>
#include <cstring>
using namespace std;
const int maxn=3e5+100;
int n;
int c1[maxn],c2[maxn];
int num[55],data[55];int sum;
void init()
{
    sum=0;
    for(int i=1;i<=n;++i)
    {
        cin>>data[i]>>num[i];
        sum+=data[i]*num[i];
    }
}
void solve()
{
    memset(c1,0,sizeof(c1));
    memcpy(c2,c1,sizeof(c1));
    for(int i=0;i<=num[1];++i)
        c1[i*data[1]]=1;
    for(int i=2;i<=n;++i)
    {
        for(int j=0;j<=sum/2;++j)
        {
            if(c1[j])
            for(int k=0;k+j<=sum/2&&k/data[i]<=num[i];k+=data[i])
                c2[k+j]+=c1[j];
        }
        memcpy(c1,c2,sizeof(c2));
        memset(c2,0,sizeof(c2));
    }
    int i=1;
    for(i=sum/2;i>=0;--i)
        if(c1[i])
            break;
    cout<<sum-i<<" "<<i<<endl;
}
int main(int argc, const char * argv[])
{
    while(cin>>n&&n>=0)
    {
        init();
        solve();
    }
    return 0;
}

Big Event in HDU

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 36975    Accepted Submission(s): 12845

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