杭电ACM hdu 1171 Big Event in HDU 解题报告(母函数)
来源:互联网 发布:java常用的容器 编辑:程序博客网 时间:2024/06/05 16:38
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
Author
lcy
Solution
以下部分的版权归本人(小飞)所有。所有权利保留。
欢迎转载,转载时请注明出处:
http://blog.csdn.net/xiaofei_it/article/details/17041709
本题直接套用母函数模板即可。关于母函数的详细解释请看:
http://blog.csdn.net/xiaofei_it/article/details/17042651
代码如下:
#include <iostream>#include <cstring>using namespace std;#define MAX 250010int n,a[MAX],b[MAX],i,j,k,last,last2,v[50],m[50];int main(){while ((cin>>n)&&n>=0){for (i=0;i<n;i++)cin>>v[i]>>m[i];a[0]=1;last=0;for (i=0;i<n;i++){last2=last+m[i]*v[i];memset(b,0,sizeof(int)*(last2+1));for (j=0;j<=m[i];j++)for (k=0;k<=last;k++)b[k+j*v[i]]+=a[k];memcpy(a,b,sizeof(int)*(last2+1));last=last2;}for (i=last/2;i>=0&&a[i]==0;i--);cout<<last-i<<' '<<i<<endl;}return 0;}
- 杭电ACM hdu 1171 Big Event in HDU 解题报告(母函数)
- 杭电 HDU ACM 1171 Big Event in HDU
- HDPJ_1171 Big Event in HDU 解题报告
- 杭电 1171 Big Event in HDU
- 杭电1171-Big Event in HDU
- 杭电1171 Big Event in HDU
- 杭电1171Big Event in HDU
- 杭电1171 Big Event in HDU(母函数+多重背包解法)
- 杭电acm 1171Big Event in HDU(0-1背包)
- HDOJ 1171 Big Event in HDU解题报告
- HDOJ-1171-Big Event in HDU 解题报告
- 杭电1171Big Event in HDU(01背包)
- HDU ACM 1171 Big Event in HDU
- hdu acm 1171 Big Event in HDU
- hdu 1171 Big Event in HDU (母函数)
- HDU 1171 Big Event in HDU (母函数)
- HDU 1171 Big Event in HDU(母函数||DP)
- hdu 1171 Big Event in HDU(母函数)
- android跨进程通信(IPC):使用AIDL
- 什么是RSS?
- Nginx+memcached+tomcat 负载均衡配置
- I you you are my I you you
- 易语言-日志记录的类,自己写的,希望大牛给改改,改的更专业点
- 杭电ACM hdu 1171 Big Event in HDU 解题报告(母函数)
- everyone I am Hello everyone I am
- Eclipse导入Tomcat源码
- Sun
- 两段网络数据包格式转换的代码,解决了汉字乱码的问题。以后要用json,这么写太麻烦了(以后我会着重优化这段代码)
- eclipse debug 重新指定源码
- 32位Win7下安装与配置PHP环境
- 动态可扩展哈希表的实现--第一集
- dsp--28335的cmd文件学习(二)