PTA甲级1007【Maximum Subsequence Sum】思路及代码（cpp/暴力n²及在线处理算法）

题目描述

1007 Maximum Subsequence Sum (25分)

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

题意理解及算法分析

给出包含K个整数的序列N，要求出这个序列中连续排列的子列中和最大的子列，并输出最大子列和及该最大子列的第一个及最后一个整数。当K个数都为负数时，最大子列和被定义为0，此时需要输出整个序列N的第一个数和最后一个数。

• 复杂度为N²的算法

  直接遍历序列N，将K个数存入数组（因为有特殊情况需要输出首位两个数，并且使用数组很适合对子列和中的数进行定位）。两重循环，外层循环变量从下标0开始，内层从i开始，到下标k-1结束，在累加的过程中判断并更新maxsum的数值。

  部分核心代码如下

  for(int i = 0; i < k; i++) {
       
      thissum = 0;
      for(int j = i; j < k; j++) {
       
          thissum += a[j