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 -21Sample Output:
10 1 4
思路
题目要求是求连续最大的子序列,输出最大值,子序列的第一个数,子序列的最后一个数。
可以设定一个sum记录最大值,一个tempsum记录临时的最大值,left记录子序列的左下标,right记录子序列的右下标,templeft记录临时的左下标。
tempsum+=v[i],若tempsum>sum,更新sum,left,right
若tempsum<0,则令tempsum=0,更新templeft=i+1
若所有数都小于0,那么认为最大和为0。
C++:
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
bool flag=false;
scanf("%d", &n);
vector<int> v(n);
int leftindex = 0, rightindex = n - 1, sum = -1, temp = 0, tempindex = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &v[i]);
if(v[i]>=0)flag=true;
temp = temp + v[i];
if (temp < 0) {
temp = 0;
tempindex = i + 1;
} else if (temp > sum) {
sum = temp;
leftindex = tempindex;
rightindex = i;
}
}
if(flag)
printf("%d %d %d", sum, v[leftindex], v[rightindex]);
else
printf("0 %d %d",v[0],v[n-1]);
return 0;
}