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,则直接从下一项开始计数。
注意点:有一个测试点是最大和就是0,题目要求是负数为0输出首尾项,不能混淆。
#include <iostream>
#include <vector>
using namespace std;
int main(){
int n, tempmax = 0, maxn = 0xffffffff, i = 0, j, First, Last;
scanf("%d",&n);
vector<int>num(n);
for(int u = 0; u < n; ++ u)
scanf("%d",&num[u]);
for(j = 0; j < n; ++ j){
tempmax += num[j];
if(tempmax > maxn){
First = num[i];
Last = num[j];
maxn = tempmax;
}
if(tempmax < 0){
tempmax = 0;
i = j + 1;
}
}
if(maxn < 0){
maxn = 0;
First = num[0];
Last = num[n - 1];
}
printf("%d %d %d", maxn, First, Last);
}