PTA 01-复杂度2 Maximum Subsequence Sum

最新推荐文章于 2024-05-19 15:25:35 发布

wynpz

最新推荐文章于 2024-05-19 15:25:35 发布

阅读量82

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/fshool/article/details/107133831

本文详细解析了求解最大子序列和问题的算法，通过在线处理思想，实现了高效求解给定整数序列中连续子序列的最大和，及其起始和结束元素。通过实例演示了算法的具体应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

PTA 01-复杂度2 Maximum Subsequence Sum

题目描述

Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.

Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.

输入格式

Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (≤10000). The second line contains K numbers, separated by a space.

输出格式

For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.

输入输出样例

输入样例#1

10
-10 1 2 3 4 -5 -23 3 7 -21

输出样例#1

10 1 4

题目思路

用在线处理的思想来解决，新输入进来的数加到now中，如果now<0,则将now置0，如果now大于max的值就将now赋给max。max置-1用来防止0为最大值，start为当前开始的坐标，rstart为最大值的开始的坐标。

#include<iostream>
using namespace std;
const int N = 1e4+10;
int a[N];
int main()
{
    int t;
    cin >> t;
    int now = 0,max = -1,start=0,rstart=0,end=t-1;
    for(int i=0;i<t;i++)
    {
        cin >> a[i];
        now += a[i];
        if(now > max){
            max = now;
            rstart = start;
            end = i;
        }
        if(now < 0){
            now = 0;
            start = i + 1;
        }
    }
    if(max == -1){
        max = 0;
    }
    cout << max << " " << a[rstart] << " " << a[end];
    return 0;
}