hdu 1087 最长上升子序列的和
来源:互联网 发布:保罗乔治身体数据 编辑:程序博客网 时间:2024/06/05 07:14
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 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
题解:
最长上升子序列。
紫书上有详细介绍。
但是这题求的是最长子序列的和。
dp[i]表示前i个数组成的最长子序列的和。
代码:
#include <bits/stdc++.h>using namespace std;const int maxn = 1000+10;int a[maxn]={0};int dp[maxn];int main(){ int n; while(scanf("%d",&n)!=EOF) { if(n==0) break; for(int i=1;i<=n;i++) { scanf("%d",&a[i]); } memset(dp,0,sizeof(dp)); for(int i=1;i<=n;i++) { for(int j=0;j<i;j++) { if(a[i]>a[j]) { dp[i]=max(dp[i],dp[j]+a[i]); } } } int* pos = max_element(dp+1,dp+n+1); cout<<*pos<<endl; } return 0;}
- HDU 1087 最长上升子序列的和
- hdu 1087 最长上升子序列的和
- HDU 1087(最长上升子序列)
- HDU 1087 最长上升子序列
- HDU 1087 最长上升子序列
- HDU 1087 Super Jumping! Jumping! Jumping!(dp最长上升子序列的和)
- 最长上升子序列的和
- 1087--最长上升子序列和
- HDU 1160(记录路径的最长上升子序列)
- HDU 1087 Super Jumping! Jumping! Jumping!(最大的上升子序列的和)(不是最长)(易混淆)
- 最长上升子序列&最大上升子序列和
- HDU 1087 Super Jumping! Jumping! Jumping!最长上升子序列
- HDU 1087最长上升子序列(DP)
- HDU 1087 && POJ 2533(DP,最长上升子序列).
- DP(最长上升子序列) HDU-1087
- hdu 1087 上升子序列最大和
- HDU 1025 最长上升子序列
- HDU 1423 最长上升公共子序列
- 约瑟夫环问题
- 快速幂运算 与 快速幂取余
- java基础——练习题纠错一
- 腾讯2016校招笔试题(含答案)
- 文件的上传servlet
- hdu 1087 最长上升子序列的和
- shiny---实现单选框联动
- 线程池的作用,应用场景与原理
- poj 1308 Is It A Tree?(并查集)
- Ext中创建Window窗体
- poj1948 Triangular Pastures(背包)
- 将xls表格数据转为点数据(1)
- 通过MyBatis Generator快速配置Mybatis
- C/C++结构体初始化