1019 Problem S

原创 2016年05月30日 09:46:19
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.<br>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&lt;N&lt;1000) kinds of facilities (different value, different kinds).<br>
 

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.<br>A test case starting with a negative integer terminates input and this test case is not to be processed.<br>
 

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.<br>
 

Sample Input
2 10 1 20 1 3 10 1 20 2 30 1 -1



解题思路:是一道01背包问题,要么是一个大一个小,要么就是两个相同,所有那个较小的数字最大只是总和的一半,用sum/2套上01背包...

#include<iostream>
using namespace std;
int max(int a,int b)
{
  if(a > b)
    return a;
  else
    return b;
}
int main()
{
    int f[200047],val[200047];
    int t,n,i,j,k,l,sum,x,y;
    while(cin>>n&&n>0){
        memset(val,0,200047);
        memset(f,0,200047);
        sum = 0;
        l = 0;
        for(i = 0 ; i < n ; i++)
            {
                cin>>x>>y;
                for(int p=0 ; p<y ; p++)
                    {
                        val[l++] = x;
                        sum+=x;
                    }
            }
            for(i = 0 ; i < l ; i++)//01背包
            {
                for(j = sum/2 ; j >= val[i]; j--)
                    {
                        f[j] = max(f[j],f[j-val[i]]+val[i]);
                    }
            }
            cout<<sum-f[sum/2]<<" "<<f[sum/2]<<endl;
    }
  return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

DFS 搜索 Problem 1019 N皇后问题

Problem ID:1019 N皇后问题 简单题意:在N*N的棋盘上放N个皇后,任意2个皇后不允许处在同一排,同一列,也不允许连线与棋盘边框成45°角。给定N,求出所有的放置方法数。(...

Codeforces Round #343 (Div. 2) -B. Far Relative’s Problem(模拟)

B. Far Relative’s Problem time limit per test 2 seconds memory limit per test 256 megabytes ...

HDU 3861 The King’s Problem (强连通+二分匹配)

题目地址:HDU 3861 这题虽然是两个算法结合起来的。但是感觉挺没意思的。。结合的一点也不自然,,硬生生的揉在了一块。。。(出题者不要喷我QAQ。) 不过这题让我发现了我的二分匹配已经好长时间...

Far Relative’s Problem

Description Famil Door wants to celebrate his birthday with his friends from Far Far Away. He has...

【Codeforces 贪心】Far Relative’s Problem

Far Relative’s ProblemDescription Famil Door wants to celebrate his birthday with his friends from ...

多校联合(4) ZZ’s Fibonacci Problem

题目链接:http://www.acmore.net/problem.php?id=1508 Stat    ZZ is a big fan of Fibonacci numb...

hdu 3681The King’s Problem(强连通分量+最小路径覆盖)

//hdu 3861 //给定一张有向图,划分成几个部分, //对于u可以到v,v可以到u的点必须在同一部分 //同一部分中u可以到v或者v可以到u //我们首先将图的强连通分量写出来,缩点, //对...

2016多校训练Contest6: 1011 Zhu’s Math Problem hdu5803

Problem Description Zhu is a powerful ACMer/OverWatcher, now a salt-fish comes to ask Zhu a diffi...

The King’s Problem (hdu 3861 强连通缩点+最小路径覆盖)

题意:n个城市m条有向边,把这些城市分成若干个州,分的原则是(1)u和v可以互相到达的话他们两个必须在同一个州(2)同一个州里任意两个城市u和v要满足u可以到达v或者v可以到达u。问州的最小个数是多少...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)