请大神指正错误代码,,小弟多谢
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
错误代码:#include<iostream> using namespace std; int data[100010]; int main() { int i_pos,f_pos; i_pos=f_pos=0; int T; cin>>T;//记录每组数据的个数; int cur,max; cur=0; max=-1;//对最大值进行标记; // 记录最大和的起始位置和结束位置 int x,s_pos,e_pos; // 将初始位置和结束位置都初始化为0; x=s_pos=0; e_pos=T-1; for (int i=0;i<T;i++) { cin>>data[i]; // 记录输入的第一个数据; i_pos=data[0]; // 记录输入的最后一个数据; f_pos=data[T-1]; if(cur+data<data) { cur=data[i]; x=data[i]; } else { cur+=data[i]; } if(cur>max) { max=cur; s_pos=x; e_pos=data[i]; } } if (max==-1) { max=0; s_pos=i_pos; e_pos=f_pos; } cout<<max<<" "<<s_pos<<" "<<e_pos<<endl; return 0; }
正确代码:
#include<iostream> using namespace std; int data[100010]; int main() { int i_pos,f_pos; i_pos=f_pos=0; int T; cin>>T;//记录每组数据的个数; int cur,max; cur=0; max=0;//对最大值进行标记; //记录最大和的起始位置和结束位置 int xs,xe,s_pos,e_pos; xs=xe=s_pos=0; e_pos=T-1; //将初始位置和结束位置都初始化为0; //输入所有的数据; for(int i=0;i<T;i++) { cin>>data[i]; } for (int i=0;i<T;i++) { //记录输入的第一个数据; i_pos=data[0]; //记录输入的最后一个数据; f_pos=data[T-1]; if(cur+data<data) { cur=data[i]; xs=i; xe=i; } else { cur+=data[i]; xe=i; } if((cur > max) || (cur == 0 && e_pos == T-1)) { max=cur; s_pos=xs; e_pos=xe; } } cout<<max<<" "<<data[s_pos]<<" "<<data[e_pos]<<endl; return 0; }