HDU1003 最大子序列和问题

{//求最大子序列和  


int maxSum = -2000,thisSum = 0,i,t=0; 


for(i=0;i

{ 


thisSum  = v[i]; 


if(thisSum>maxSum) 


{ 


maxSum = thisSum; 


start = t; 


end = i; 


} 


if(thisSum<0) 


{ 


thisSum = 0; 


t = i 1; 


} 


} 


return maxSum;


} 


int main(int argc, char *argv[]) 


{ 


int caseNum,curCase=0,nNum,temp,maxSum=0,start=0,end=0; 


cin>>caseNum; 


do 


{ 


curCase ; 


cin>>nNum; 


vector v; 


for(int i=0;i

{ 


cin>>temp; 


v.push_back(temp); 


} 


cout<<"Case "<

maxSum = MaxSubSum(v,start,end); 


cout<

if(curCase

cout<

}while(curCase

return 0;