PTA——01-复杂度2 Maximum Subsequence Sum (25 分)(C++题解)

最新推荐文章于 2022-03-27 18:13:52 发布

sponge-dad

最新推荐文章于 2022-03-27 18:13:52 发布

阅读量150

点赞数 4

分类专栏：笔记文章标签： c++

本文链接：https://blog.csdn.net/qq_51831175/article/details/115679534

版权

笔记专栏收录该内容

4 篇文章 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

我的思路 :

首先呢拿到这道题肯定知道是一道小小的动态规划，这应该是一道很经典的动规题了，之前有一道是只输出 最大子列和 即可，这道题有多让你输出两个数据：子列的 起始值 和 终点值 。那么最大子列和的计算方法就是：“ 在线处理 ”

首先点定义一个ThisSum代表每输入一个数字，就进行加和，再定义一个MaxSum表示目前最大子列的和；接着每输入一个数字a[i]，先让ThisSum加上a[i]，当ThisSum小于0的时候，显然我们就不需要这一串序列的和ThisSum，如果大于0的话呢，我们比较ThisSum和MaxSum的大小，若ThisSum > MaxSum 就 MaxSum = ThisSum；

那怎么进行标记序列的起点和终点呢？
每当 ThisSum < 0 被舍去时，这时候就得到了一个新的子列的起点，我们对这个起点进行标记 count = i+1；
否则，当 ThisSum > MaxSum 时我们得到了目前最大子列的一个新的终点，
这时候我们让pos1 = count， pos2 = i，来更新我们子列的起点和终点。

运行时可得到以下运行顺序：

在这里插入图片描述

代码如下：

# include <iostream>
using namespace std;
const int MAXN = 7+10e4;

int main(void)
{
    int n;
    int num, a[MAXN];
    int pos1 = 0, pos2 = 0;
    int count = 0;
    int ThisSum = 0, MaxSum = -1;
    cin >> n;
    pos2 = n-1;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        ThisSum += a[i];
        if(ThisSum < 0){
                ThisSum = 0;
                count = i+1;
            }
        else if(ThisSum > MaxSum){
            MaxSum = ThisSum;
            pos1 = count;
            pos2 = i;
        }
        
    }
    if(MaxSum < 0) MaxSum = 0;

    cout << MaxSum << ' ' << a[pos1] << ' ' << a[pos2];

    system("pause");
    return 0;
}