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
主要思路:1、在线处理的思想巧妙地解决此问题(浙大版数据结构看过此题目的解析,所以第一反应就是在线处理)
2、注意题目的要求,对于特殊输入的处理
#include <iostream> using namespace std; #define Max_num 10000 int main(int argc, const char * argv[]) { //Store the numbers int value[Max_num]={0}; int K=0; cin>>K; for (int i=0; i<K; ++i) { cin>>value[i]; } //Calculate int begin=0,end=0; int begin_temp=0; int max=-1,flag=0; int temp=0; for (int i=0; i<K; ++i) { if (value[i]>=0) { flag=1; } temp+=value[i]; if (temp<0) { temp=0; begin_temp=i+1; }else if(temp>max) { begin=begin_temp; end=i; max=temp; } } if(!flag) { cout<<'0'<<' '<<value[0]<<' '<<value[K-1]; }else { cout<<max<<' '<<value[begin]<<' '<<value[end]; } return 0; }