01-复杂度2 Maximum Subsequence Sum

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

原创最新推荐文章于 2024-05-19 15:25:35 发布 · 307 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #数据结构

给定一个整数序列，找到具有最大和的连续子序列，并输出其最大和以及该子序列的第一个和最后一个数字。如果所有数字都是负数，则最大和为0，并输出整个序列的首尾数字。程序使用动态规划方法解决此问题。

问题

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.

Input Specification:

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.

Output Specification:

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.

Sample Input:

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

Sample Output:

10 1 4

解答

#include <iostream>

using std::cin;
using std::cout;
using std::endl;

void MaxSubseqSum(int A[], int N);

int main()
{
    int K;
    cin >> K;
    int series[K];
    for (int i = 0; i < K; ++i)
        cin >> series[i];
    MaxSubseqSum(series, K);
    return 0;
}

void MaxSubseqSum(int A[], int N)
{
    int ThisSum, MaxSum;
    int left, right;
    int current = 0;
    left = 0;
    right = N - 1;
    ThisSum = 0;//当前和默认为0
    MaxSum = -1;//最大和默认为-1以将全复数情况转化为普通情况
    for (int i = 0; i < N; i++)
    {
        ThisSum += A[i];
        if (ThisSum > MaxSum)
        {
            MaxSum = ThisSum;
            //最大和更新后，左右下标依次更新
            right = i;
            left = current;
        }
        else if (ThisSum < 0)
        {
            ThisSum = 0;
            current = i + 1;//当前下标更新
        }
    }
    cout << (MaxSum > 0 ? MaxSum : 0) << " " << A[left] << " " << A[right] << endl;
}