Fighting

分寸 , 克制

HDU 1087

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);
	
    }

}



阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/qq_33048603/article/details/51917836
个人分类: ACM解题报告
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

HDU 1087

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭