PTA 01-复杂度2 Maximum Subsequence Sum (25 分)

PTA 01-复杂度2 Maximum Subsequence Sum (25 分)

Given a sequence of K integers { N ​ 1 , N 2 , N 3 , . . . , N K } \{ N_​1,N_2,N_3,...,N_K\} {N​​1,N2​,N3​,...,NK​}
A continuous subsequence is defined to be { N i , N i + 1 , . . . , N j , N j + 1 } \{ N_i,N_{i+1},...,N_j,N_{j+1}\} {Ni​,Ni+1​,...,Nj​,Nj+1​}
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的时候要包括0
• 全部为负数的时候输出0 0 0

代码

在最大子列和的基础上修改

#include <iostream>

using namespace std;

int main()
{
    int number = 0;
    cin>>number;
    //int * n = new int(number);
    int n[100000];
    int subsequence [1000000];
    int i =0;
    while(i<number)
    {
        cin>>n[i++];
    }
    int temp =0;
    int max =0;
    int begin =0;
    int tempbegin =0;
    int end = number-1;
    for(i =0;i<number;i++)
    {
        
        temp += n[i];
       
        if(temp>max||(temp==max&&max==0))
        {   
            max = temp;
            begin = tempbegin;
            end =i;
            
        }
         if(temp<0)
        {
            tempbegin =i+1;//第i个数使数列和变小，从它的下一个数开始重新计数列
            temp =0;
        }
        
    }
    cout<<max<<' ';
    cout<<n[begin] <<' ';
    cout<<n[end];
    //delete [] n;
    return 0;
}

• 注意begin和end指针的更新
• tempbegin记录上一次查找子列和时候的头，防止begin被更新为非最大子列和的头
• (tempmax&&max0)判断条件是用于数串为负数和零的情况
• tempbegin更新的判断条件temp<0，不能temp<=0,否者若最大子列和前有0，0无法被囊括。