PAT甲级007 Maximum Subsequence Sum

最新推荐文章于 2022-05-06 09:10:14 发布

不再犹豫！！

最新推荐文章于 2022-05-06 09:10:14 发布

阅读量97

点赞数

分类专栏： PAT 文章标签：最大子序列和算法增益法序列处理 C++

本文链接：https://blog.csdn.net/qq_45588569/article/details/114465484

版权

PAT 专栏收录该内容

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

中文题目

最大公共子序列问题，特殊点在于如果全为负数，则输出结果为0；

解题思路

前人经验：增益法
1，一维数组存储数据。
2，从第一个数起进行累加求和，如果sum>maxsum,更新maxsum和start,last,start_t,last_t;如果sum<0,则说明之前的结果是负增益的，需要舍弃，sum=0，start=list[i+1];last=list[i+1];

代码

下面展示一些 内联代码片。

// A code block
var foo = 'bar';

#include<bits/stdc++.h>
using namespace std;
int main(void){
    int num,start,last,start_t,last_t;
    cin>>num;
    bool flag = false;
    int list[10000]={0};
    for(int i=0;i<num;i++){
        cin>>list[i];
        if(list[i]>=0){
            flag=true;
        }
    }
    if(flag==false){
       cout<<0<<' '<<list[0]<<' '<<list[num-1] ;
       return 0;;
    }
    start=last=list[0];
    int maxsum=INT_MIN;
    int sum=0;
    for(int i=0;i<num;i++){
        sum+=list[i];
        if(sum>maxsum){
           maxsum = sum;
           last=list[i];
           start_t=start;
           last_t=last;
        }
        if(sum<0){
            sum=0;
            if(i<num-1){
            start=list[i+1];
            last=list[i+1]; 
            }
            
        }
        
    }
    cout<<maxsum<<' '<<start_t<<' '<<last_t;
    
    return 0;
}