HDU 1087
来源:互联网 发布:mac淘宝助手官方下载 编辑:程序博客网 时间:2024/06/04 19:29
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.
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.
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 24 1 2 3 44 3 3 2 10
Sample Output
4103
**题意:第一个数代表数组的的个数,接下来的数字是一个数组,求这个数组的最长上升子序列的和**
**没什么难的,水题,都是模板**
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
- HDU 1087
- hdu 1087
- hdu 1087
- HDU 1087
- hdu 1087
- hdu 1087
- hdu 1087
- hdu 1087
- HDU 1087
- hdu 1087
- hdu 1087
- hdu 1087
- HDU 1087
- hdu-1087
- hdu 1087
- hdu 1087
- HDU 1087
- HDU-1087
- 去掉Qwt画布左下角缺口
- redis的C/C++ API
- 一个收集了502款开源iOS应用的开源项目
- sqlserver2008中主要的系统表说明
- linux shell下除了某个文件外的其他文件全部删除的命令
- HDU 1087
- 友好的显示时间 PHP端
- 算法竞赛入门经典chapter4:本章小结
- LoadRunner调用md5方法
- 过滤掉表情图片
- powershell加载mimikatz 抓密码 (无文件,躲过杀软,可以nc回显) 20160715
- YARN ResourceManager调度器的分析
- mac配置path的几种方式
- 学习网站与资源推荐