关闭

HDU 1087

939人阅读 评论(0) 收藏 举报
分类:

Description

Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now.



The game can be played by two or more than two players. It consists of a chessboard(棋盘)and some chessmen(棋子), and all chessmen are marked by a positive integer or “start” or “end”. The player starts from start-point and must jumps into end-point finally. In the course of jumping, the player will visit the chessmen in the path, but everyone must jumps from one chessman to another absolutely bigger (you can assume start-point is a minimum and end-point is a maximum.). And all players cannot go backwards. One jumping can go from a chessman to next, also can go across many chessmen, and even you can straightly get to end-point from start-point. Of course you get zero point in this situation. A player is a winner if and only if he can get a bigger score according to his jumping solution. Note that your score comes from the sum of value on the chessmen in you jumping path.
Your task is to output the maximum value according to the given chessmen list.
 

Input

Input contains multiple test cases. Each test case is described in a line as follow:
N value_1 value_2 …value_N
It is guarantied that N is not more than 1000 and all value_i are in the range of 32-int.
A test case starting with 0 terminates the input and this test case is not to be processed.
 

Output

For each case, print the maximum according to rules, and one line one case.
 

Sample Input

3 1 3 2 4 1 2 3 4 4 3 3 2 1 0
 

Sample Output

4 10 3
 

**题意:第一个数代表数组的的个数,接下来的数字是一个数组,求这个数组的最长上升子序列的和**

**没什么难的,水题,都是模板**

import java.util.Arrays;
import java.util.Scanner;

public class Main{
    private static int num = 0;
    private static int[] array = new int[10010];
   
    private static int[] temp_array = new int[10010];

    public static void main(String[] args) {
	Scanner scanner = new Scanner(System.in);
	while (true) {
	    num = scanner.nextInt();
	    init();
	    if (num == 0)
		break;
	    for (int i = 0; i < num; i++) {
		array[i] = scanner.nextInt();		
	    }
	    for (int i = 0; i < num; i++) {
		temp_array[i] = array[i];
		for (int j = i-1; j >=0; j--) {
		    if (array[j]<array[i]&&temp_array[j]+array[i]>temp_array[i]) {
			temp_array[i] = temp_array[j] +array[i];
		    }
		}
	    }
	    int sum =temp_array[0];
	    for (int i = 0; i <num; i++) {
		if (sum<temp_array[i]) {
		    sum = temp_array[i];
		}
	    }
	    System.out.println(sum);
	}
	scanner.close();
	   
    }


    private static void init() {
	Arrays.fill(array, 0);
	Arrays.fill(temp_array, 0);
	
    }

}



1
0
查看评论

杭电acm1087

dp问题: ans[i] = max(ans[j]) + d[i],循环条件:d[j] #include #include int main() { int d[1001], ans[1001]; int n, i, j, flag, rst; while(~scanf(&quo...
  • riverflowrand
  • riverflowrand
  • 2015-11-15 13:49
  • 516

hdu acm 1087

据说是很简单的dp……不过一开始实在没看出 dp状态…… dp状态: dp状态:sum[i] = max{sum[i]} +a[j]           0<=i<=j     ...
  • superalsrk
  • superalsrk
  • 2010-05-18 21:19
  • 489

hdu 1087 Super Jumping! Jumping! Jumping!(dp:上升子序列最大和)

Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submi...
  • acm_BaiHuzi
  • acm_BaiHuzi
  • 2015-03-21 00:40
  • 673

HDU1087 超级跳跃(递增子序列最大和)

Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submi...
  • linyuxilu
  • linyuxilu
  • 2017-02-27 20:35
  • 301

动态规划:HDU1087-Super Jumping! Jumping! Jumping!(最大上升子序列和)

Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submiss...
  • yopilipala
  • yopilipala
  • 2017-07-05 09:35
  • 303

HDU1087:Super Jumping! Jumping! Jumping!(DP)

Problem Description Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and kn...
  • libin56842
  • libin56842
  • 2013-08-26 17:34
  • 5718

HDU 1087 && POJ 2533(DP,最长上升子序列).

~~~~ 两道题的意思差不多,HDU上是求最长上升子序列的和,而POJ上就的是其长度。 貌似还有用二分写的nlogn的算法,不过这俩题n^2就可以过嘛。。 ~~~~ 题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1087 http:/...
  • u013519226
  • u013519226
  • 2014-08-02 22:13
  • 1051

51Nod-1087-1 10 100 1000

ACM模版描述题解找规律,查找数列中1的通式。 (0+1+2+…n)+1==N (o+n)*(n+1)/2+1==N n*(n+1)==(N-1)*2 (N-1)*2=m*m n代码 #include <iostream> #include <cstdi...
  • f_zyj
  • f_zyj
  • 2016-07-30 21:51
  • 461

51NOD 1087 1 10 100 1000

1087 1 10 100 1000 题目来源: Ural 1209 基准时间限制:1 秒 空间限制:131072 KB 分值: 5 难度:1级算法题  收藏  关...
  • qq_27717967
  • qq_27717967
  • 2015-12-27 13:34
  • 390

hdu 1087 hdoj 1087

Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submi...
  • sonfree
  • sonfree
  • 2011-12-09 10:01
  • 92
    个人资料
    • 访问:112199次
    • 积分:1387
    • 等级:
    • 排名:千里之外
    • 原创:41篇
    • 转载:3篇
    • 译文:0篇
    • 评论:32条
    博客专栏
    最新评论