PTA甲级-1007 Maximum Subsequence Sum

郑辉辉

于 2023-02-04 20:47:25 发布

阅读量570

点赞数 1

分类专栏： PTA甲级刷题文章标签：算法 c++ pat考试数据结构

本文链接：https://blog.csdn.net/weixin_44884298/article/details/128885473

版权

PTA甲级刷题专栏收录该内容

13 篇文章 0 订阅

订阅专栏

文章目录

题目内容
一、题干大意
二、题解要点
三、具体实现

题目内容

Given a sequence of K integers { N1, N2, …, N**K }. A continuous subsequence is defined to be { N**i, N**i+1, …, N**j } 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

一、题干大意

给出一串数字，要求输出其中连续的、总和最大的一串。如果有两串总和一样的，就输出位置靠前的那串；如果总和为负数的，就输出0和最前最后的两个数字。

二、题解要点

动态规划的题目，其中最重要的思路就是当temp为负数的时候就把temp回归为0，并且从下一个位置开始重新计算总和。

三、具体实现

/**
*@Author：hhzheng
*@Date：2023/2/4  17:50
*@Filename：PAT甲级 1007 Maximum Subsequence Sum
*/

#include <iostream>
#include <vector>
using namespace std;
int main() {
    int n;
    scanf("%d", &n);
    vector<int> v(n);
    //leftIndex和rightIndex两个指明位置的参数直接设置为第一个和最后一个
    //以便作为总和小于0的那种情况的输出
    int leftIndex = 0, rightIndex = n - 1, sum = -1, temp = 0, tempIndex = 0;
    for (int i = 0; i < n; i++) {
        scanf("%d", &v[i]);
        //temp用来记录当前的总和
        temp = temp + v[i];
        //如果temp已经小于0了，那么这样的一串数就可以放弃了，因为从小于0开始加肯定不如直接放弃掉
        if (temp < 0) {
            temp = 0;
            tempIndex = i + 1;
        } else if (temp > sum) {
            //如果temp超过了历史记录的话 就把leftIndex转到tempIndex，rightIndex转到当前的下标
            sum = temp;
            leftIndex = tempIndex;
            rightIndex = i;
        }
    }
    if (sum < 0) sum = 0;
    printf("%d %d %d", sum, v[leftIndex], v[rightIndex]);
    return 0;
}