求一个序列最大的上升子序列的和

最新推荐文章于 2020-03-26 16:23:41 发布

转载最新推荐文章于 2020-03-26 16:23:41 发布 · 348 阅读

LIC LCS 专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种算法，用于解决寻找一组数值中最大上升子序列的问题，并通过具体实例展示了如何实现这一算法。该算法首先初始化一个存储最大子序列和的数组，然后遍历输入的数值，对于每个数值，它都会检查所有之前的数值来确定当前的最大子序列和。

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

Sample Output

4
10
3

求这些数的最大的上升子序列

#include <iostream>
#include <cstdio>
using namespace std;
const int maxn = 1005;
int sum[maxn];
int data[maxn];
int n;
int LIS_SUM()
{
    int i;
    int j;
    int maxSum = -9999;
    memset(sum,0,sizeof(sum));
    for(i = 1 ; i <= n ; ++i)
    {
        int temp = 0;
        for(j = 1 ; j < i ; ++j)
        {
            if(data[j] < data[i])
            {
                if(temp < sum[j])
                {
                    temp = sum[j];
                }
            }
        }
        sum[i] = data[i] + temp;
        if(maxSum < sum[i])
        {
            maxSum = sum[i];
        }
    }
    return maxSum;
}
int main()
{
    while(scanf("%d",&n)!=EOF,n)
    {
        int i;
        for(i = 1 ; i <= n ; ++i)
        {
            scanf("%d",&data[i]);
        }
        printf("%d\n",LIS_SUM());
    }