# HDU1087 / SDNU1330 求上升序列最大和

0）

1）HDU

①：

#include <iostream>
#include <stdio.h>
#include <string.h>

using namespace std;
int a[1010];//value
long long int sum[1001];
int main()
{
int n;
while(~scanf("%d",&n)&&n!=0)
{
a[0]=0;
sum[0]=0;
for(int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
sum[i]=a[i];
}
for(int i=1; i<=n; i++)
{
long long int temp=sum[i];
for(int j=i-1; j>=0; j--)
{
if(a[j]<a[i])
{
if((sum[j]+a[i])>temp)
temp=sum[j]+a[i];
}
}
sum[i]=temp;
}
long long int maxx=0;
for(int i=1; i<=n; i++)
{
maxx=max(maxx,sum[i]);
}
cout<<maxx<<endl;
}
return 0;
}

#include <iostream>
#include <stdio.h>
#include <string.h>

using namespace std;
int a[1010];//value
long long int sum[1001];
int main()
{
int n;
while(~scanf("%d",&n)&&n!=0)
{
a[0]=0;
sum[0]=0;
for(int i=1; i<=n; i++)
{
scanf("%d",&a[i]);
sum[i]=a[i];
}
for(int i=1; i<=n; i++)
{
long long int temp=sum[i];
for(int j=i-1; j>=0; j--)
{
if(a[j]<a[i])
{
if((sum[j]+a[i])>temp)
temp=sum[j]+a[i];
}
}
sum[i]=temp;
}
long long int maxx=0;
for(int i=1; i<=n; i++)
{
maxx=max(maxx,sum[i]);
}
cout<<maxx<<endl;
}
return 0;
}

2）

SDNU：

### Description

n<=1000,0<ai<=109

### Sample Input

62 4 1 20 5 6

### Sample Output

26

HDU：

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

• 本文已收录于以下专栏：

## 九度OJ 1480 最大上升子序列和 -- 动态规划

• JDPlus
• 2014年03月01日 17:43
• 4117

## 求最大子序列之和的四种方法

﻿四种求最大子序列和的方法，效率一个比一个高。 方法二是方法一的改进 方法三是采用分治的思想，编写递归函数 方法四 最为巧妙，代码少，效率高，逻辑清晰 对原书中的代码做了一小点...
• aa8568849
• 2016年09月22日 15:44
• 307

## 最大子序列和的四种算法

1.穷举法 算法思想：算出每个子序列的和，即算出序列中第i个到第j个数的和(j>=i)，并进行比较 算法： public static int maxSubSum1(int[] a) { in...
• zzl913657644
• 2016年09月04日 13:37
• 4738

## HDU 5256 序列变换（最长上升子序列）

Problem Description 我们有一个数列A1,A2…An，你现在要求修改数量最少的元素，使得这个数列严格递增。其中无论是修改前还是修改后，每个元素都必须是整数。 请输出最少需要修改多...
• miao_2cm
• 2016年07月29日 15:46
• 533

## 求数组最大子序列的和

• a253664942
• 2016年04月03日 18:55
• 1535

## 最长上升子序列（LIS），求长度并打印子序列

#include using namespace std; int solve(int* a, int n) { int* dp = new int[n]; int res = 0...
• wwj_ff
• 2015年06月03日 17:47
• 824

## 导弹拦截n logn的算法（单调性）洛谷1020

• c201904
• 2017年08月26日 15:45
• 96

## 求子序列的和的最大值

• qq_24861509
• 2015年08月28日 17:41
• 1036

## hdu1087（上升子序列的最大和）

Problem - 1087 http://acm.hdu.edu.cn/showproblem.php?pid=1087 /*************************** # 201...
• u011282069
• 2013年09月13日 13:49
• 656

## 最大连续子序列和：动态规划经典题目(2)

• samjustin1
• 2016年07月27日 10:47
• 4345

举报原因： 您举报文章：HDU1087 / SDNU1330 求上升序列最大和 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)