动态规划J
来源:互联网 发布:棉麻格子连衣裙淘宝 编辑:程序博客网 时间:2024/06/05 04:21
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
import java.util.ArrayList;import java.util.Arrays;import java.util.Scanner;/** * Created by 95112 on 10/28/2017. */public class BigEvent { public static void main(String[] srgs) { Scanner scanner = new Scanner(System.in); ArrayList<String> answers = new ArrayList<>(); do { int N = scanner.nextInt(); if (N <=0) break; int[] facilities = new int[100000000]; int count = 0; int sum = 0; for (int i = 0 ; i < N;i++) { int V = scanner.nextInt(); int M = scanner.nextInt(); for (int j = 0; j< M;j++){ facilities[count++] = V; sum += V; } } int half = sum/2; // error int[] dp = new int[half+1]; dp[0] = 0; for (int i =0 ; i < count;i++){ for(int j = half ; j > 0; j--){ if (facilities[i] <= j && dp[j - facilities[i]] + facilities[i] <= half){ dp[j] = max(dp[j] , dp[j - facilities[i]] + facilities[i]); } } } // System.out.printf((sum-dp[half])+" "+dp[half]+"\n"); answers.add((sum-dp[half])+" "+dp[half]+"\n"); }while(true); for (String answer : answers) System.out.print(answer); } private static int max(int a,int b){ if (a > b) return a; else return b; }}/*20 1040 40 */
- 动态规划 problem J
- 动态规划J
- 动态规划—Problem J
- 暑假-动态规划 III-J - The Peanutsw
- 动态规划——problem j】
- DP 动态规划 Problem J 1010 上楼梯问题
- 动态规划中的最优二叉搜素树的介绍与理解(包含c源代码打印相关数据:e[i][j],root[i][j],w[i][j])
- 动态规划1:J - 搬寝室(状态方程与memset的小技巧)
- J - FatMouse's Speed HDU 1160 (动态规划,最长上升子序列+路径输出)
- 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest J Bottle动态规划
- 动态规划!!!动态规划!!!
- 动态规划
- 动态规划
- 动态规划
- 动态规划
- 动态规划
- 动态规划
- 动态规划
- mysql 时间戳与日期格式之间相互转换
- 手机之后,董明珠杀入汽车市场,格力拟130亿收购珠海银隆
- 四岁的微信公众平台,是如何从“小个体”成长为“大平台”的?
- 本周锋评:谁敢偷我无人车的车轱辘?
- C#数据结构--栈Stack
- 动态规划J
- python-正则表达式
- OpenCV(四)图像算术、混合
- 关于0-1背包问题的个人理解
- Java 模拟器-接口
- 处理JS分页加载的网页_recv
- c++学习笔记
- ubuntu eclipse CDT编译mysql源码
- Workerman