杭电1171（01背包求解）

题目：

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

10 1

20 1

10 1

20 2

30 1

-1

Sample Output

20 10

40 40

思路：

求出sum /= 2;

将sum当做容量，进行01背包求解。

 1 #include<stdio.h>
 2 #include<string.h>
 3
 4 int everyv[250001], dp[250001];
 5
 6 int getmax(int x, int y){
 7     return x > y ? x : y;
 8 }
 9
10 int main(){
11     int n, i, j, v, num,  cout, sum, sum2;
12     while(scanf("%d", &n) && n >= 0){
13         cout = 0;
14         sum = 0;
15         while(n --){
16             scanf("%d %d", &v, &num);
17             sum += v * num;
18             while(num --){
19                 everyv[cout ++] = v;
20             }
21         }
22         sum2 = sum;
23         sum /= 2;
24         memset(dp, 0, sizeof(dp));
25         for(i = 0; i < cout; i ++){
26             for(j = sum; j >= everyv[i]; j --){
27                 dp[j] = getmax(dp[j], dp[j - everyv[i]] + everyv[i]);
28             }
29         }
30         printf("%d %d\n", sum2 - dp[sum], dp[sum]);
31     }
32     return 0;
33 }

View Code

转载于:https://www.cnblogs.com/xiaoyeye/p/3736596.html

杭电1171（01背包求解）相关推荐

杭电1963 完全背包
完全背包,但是总容量不稳定,随着每年的盈利,背包容量在变大,而且,题目给的数据比较大,但是给的有投资的都是1000 的倍数,运用的时候除以1000即可,附代码: Time Limit : 5000/1 ...
经典背包问题 01背包+完全背包+多重背包
01 背包有n 种不同的物品,每个物品有两个属性,size 体积,value 价值,现在给一个容量为 w 的背包,问最多可带走多少价值的物品. int f[w+1]; //f[x] 表示背包容量为x ...
背包问题教程-01背包，完全背包，多重背包，混合背包收藏
P01: 01背包问题题目有N件物品和一个容量为V的背包.第i件物品的费用是c[i],价值是w[i].求解将哪些物品装入背包可使价值总和最大. 基本思路这是最基础的背包问题,特点是:每种物品仅有 ...
动态规划-----------01背包，完全背包与多重背包
P01: 01背包问题题目有N件物品和一个容量为V的背包.第i件物品的费用是c[i],价值是w[i].求解将哪些物品装入背包可使价值总和最大. 基本思路这是最基础的背包问题,特点是:每种物品仅有 ...
LeetCode 1774. 最接近目标价格的甜点成本（DFS / 01背包）
文章目录 1. 题目 2. 解题 1. 题目你打算做甜点,现在需要购买配料.目前共有 n 种冰激凌基料和 m 种配料可供选购.而制作甜点需要遵循以下几条规则: 必须选择一种冰激凌基料. 可以添加 ...
背包九讲系列1——01背包、完全背包、多重背包
我在进行一些互联网公司的技术笔试的时候,对于我来说最大的难题莫过于最后的那几道编程题了,这对算法和数据结构有一定程度上的要求,而"动态规划"又是编程题中经常出现的算法类型,并且对于 ...
动态规划背包问题小结 0-1背包(采药九度第101题) 完全背包(Piggy-Bank POJ 1384) 多重背包(珍惜现在，感恩生活九度第103题)
本小结介绍0-1背包.完全背包以及多重背包问题记忆要点: 0-1背包:二维数组情况下,顺序遍历体积或者倒序均可以降维情况下需倒序遍历体积完全背包:数组降维+顺序遍历 ...
杭电1203--I NEED A OFFER!（01背包）
I NEED A OFFER! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) ...
杭电1284钱币兑换问题—背包dp/母函数(java)
Problem Description 在一个国家仅有1分,2分,3分硬币,将钱N兑换成硬币有很多种兑法.请你编程序计算出共有多少种兑法. Input 每行只有一个正整数N,N小于32768. Out ...

杭电1171（01背包求解）

杭电1171（01背包求解）相关推荐

最新文章

热门文章