zoj1093 Monkey and Banana 动态规划
来源:互联网 发布:php 循环拼接字符串 编辑:程序博客网 时间:2024/06/07 11:09
A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some blocks. If the monkey is clever enough, it shall be able to reach the banana by placing one block on the top another to build a tower and climb up to get its favorite food.
The researchers have n types of blocks, and an unlimited supply of blocks of each type. Each type-i block was a rectangular solid with linear dimensions (xi, yi, zi). A block could be reoriented so that any two of its three dimensions determined the dimensions of the base and the other dimension was the height.
They want to make sure that the tallest tower possible by stacking blocks can reach the roof. The problem is that, in building a tower, one block could only be placed on top of another block as long as the two base dimensions of the upper block were both strictly smaller than the corresponding base dimensions of the lower block because there has to be some space for the monkey to step on. This meant, for example, that blocks oriented to have equal-sized bases couldn't be stacked.
Your job is to write a program that determines the height of the tallest tower the monkey can build with a given set of blocks.
Input Specification
The input file will contain one or more test cases. The first line of each test case contains an integer n,representing the number of different blocks in the following data set. The maximum value for n is 30.
Each of the next n lines contains three integers representing the values xi, yi and zi.
Input is terminated by a value of zero (0) for n.
Output Specification
For each test case, print one line containing the case number (they are numbered sequentially starting from 1) and the height of the tallest possible tower in the format "Case case: maximum height = height"Sample Input
110 20 3026 8 105 5 571 1 12 2 23 3 34 4 45 5 56 6 67 7 7531 41 5926 53 5897 93 2384 62 6433 83 270
Sample Output
Case 1: maximum height = 40Case 2: maximum height = 21Case 3: maximum height = 28Case 4: maximum height = 342
import java.io.BufferedInputStream;import java.io.PrintWriter;import java.util.ArrayList;import java.util.Collections;import java.util.List;import java.util.Scanner;public class Main {public static void main(String[] args) {new Task().solve();}}class Task {Scanner in = new Scanner(new BufferedInputStream(System.in)) ;PrintWriter out = new PrintWriter(System.out);class Node implements Comparable<Node>{int x , y , z ;Node(int x , int y , int z){this.x = x ;this.y = y ;this.z = z ;}@Overridepublic int compareTo(Node other) {return this.x != other.x ? Integer.compare(this.x , other.x) : Integer.compare(this.y , other.y) ;}public boolean lessThen(Node other){return (this.x < other.x && this.y < other.y) ;}}void solve() {int cas = 1 ;while(true){int n = in.nextInt() ;if(n == 0){break ;}List<Node> nodes = new ArrayList<Task.Node>() ; while(n-- > 0){int x = in.nextInt() ;int y = in.nextInt() ;int z = in.nextInt() ;nodes.add(new Node(x, y, z)) ;nodes.add(new Node(y, x, z)) ;nodes.add(new Node(z, y, x)) ;nodes.add(new Node(y, z, x)) ;nodes.add(new Node(z, x, y)) ;nodes.add(new Node(x, z, y)) ;}int reslut = 0 ; Collections.sort(nodes) ;n = nodes.size() ;int[] dp = new int[n] ;for(int i = 0 ; i < n ; i++){ dp[i] = nodes.get(i).z ;for(int j = 0 ; j < i ; j++){ if(nodes.get(j).lessThen(nodes.get(i)) && dp[j] + nodes.get(i).z > dp[i]){ dp[i] = nodes.get(i).z + dp[j] ; } }reslut = Math.max(reslut , dp[i]) ;}out.println("Case " + cas++ + ": maximum height = " + reslut) ;}out.flush(); }}
- zoj1093 Monkey and Banana 动态规划
- ZOJ1093 HDU1069 Monkey and banana
- zoj1093题解 Monkey and Banana
- Monkey and Banana(zoj1093)
- HDOJ-Monkey and Banana-动态规划
- HDU 1069 Monkey and Banana 动态规划
- HDU 1069 Monkey and Banana ( 动态规划 )
- HDU 1069 Monkey and Banana 动态规划
- hdoj-1069-Monkey and Banana【动态规划】
- HDU 1069(Monkey and Banana)动态规划
- hdu 1069 Monkey and Banana(动态规划)
- Monkey and Banana (zoj 1093 动态规划)
- hdu-1069-Monkey and Banana(动态规划)
- Hdu 1069 Monkey and Banana 动态规划
- HDU Monkey and Banana 动态规划
- HDU1069 Monkey and Banana (动态规划)
- 动态规划:HDU1069-Monkey and Banana
- 【hdu1069】Monkey and Banana (动态规划)
- 浏览器缓存知识小结及应用
- ZOJ
- eclipse中查看jar包中的源码
- BRD、MRD 和 PRD
- 最小生成树
- zoj1093 Monkey and Banana 动态规划
- Leetcode 448 线性时间算法
- mysql 使用in()函数时的一个注意事项
- C++强制类型转换操作符 static_cast
- abstract与static、synchronized、native不能同时使用的原因
- 使用CSS和Js实现时钟效果
- SQL中distinct和row_number() over() 的区别及用法
- 字符串是否包含
- 什么是constrained MD