1007 Maximum Subsequence Sum (25 分)

最新推荐文章于 2024-09-13 16:27:15 发布

KrisFeng00

最新推荐文章于 2024-09-13 16:27:15 发布

阅读量63

点赞数

分类专栏： C++ PTA 算法

本文链接：https://blog.csdn.net/The_worst/article/details/115469722

版权

动态规划最大子序列和算法编程序列处理

关键词由CSDN通过智能技术生成

C++ 同时被 3 个专栏收录

9 篇文章 0 订阅

订阅专栏

PTA

8 篇文章 0 订阅

订阅专栏

算法

6 篇文章 0 订阅

订阅专栏

1007 Maximum Subsequence Sum (25 分)

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.

input

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

output

10 1 4

这一题考点在于求最大字段和，然后标记下开始位置，结束的位置，没有什么难点，我用到了动态规划的方法

注意

这里的几个测试点
a）和小于0，maxSum = 0，startPos = 0，endPos = n - 1
b）和等于0，maxSum = 0，startPos = 0，endPos = 0

#include <iostream>
#include <cstring>
#include <string>
using namespace std;
int n, startPos,tempStartPos , endPos;
long long maxSum = -0x8000000000000000, tempSum = 0;
void MaxSum(long long array[], int n){
    int count = n;
    startPos = tempStartPos = 0;
    endPos = n - 1;
    for(int i = 0; i < count; i++){
        tempSum = (tempSum + array[i]) > array[i] ? (tempSum + array[i]) : array[i];
        if(tempSum < 0){
            tempSum = 0;
            tempStartPos = i + 1;
        }else if(tempSum > maxSum){
            maxSum = tempSum;
            startPos = tempStartPos;
            endPos = i;
        }
    }
}
int main(){
    long long array[30000];
    cin >> n;
    if(n == 0){
        cout<< "0 0 0";
        return 0;
    }
    for(int i = 0; i < n; i++){
        cin>> array[i];
    }
    MaxSum(array, n);
    if(maxSum < 0){
        cout<< 0 <<" "<< array[0] << " "<< array[n - 1];
    }
    else if (maxSum == 0){
        cout<< "0 0 0";
    }
    else{
        cout<< maxSum<<" "<< array[startPos] <<" "<<array[endPos] ;
    }
    return 0;
}

求最大字段和的方法可以参考我的另一篇blog
https://editor.csdn.net/md/?articleId=115467927