用分治法求最大子段和
这是我的代码,但是一运行就出现如下结果:
#include
using namespace std;
//使用分治算法
int maxSubSum(int* a,int left,int right,int &start,int &end)
{
int sum=0;
if(left==right)
{
sum=a[left]>0? a[left]:0;
start=end=left;
}
else
{
int center=(left+right)/2;
int leftSum=maxSubSum(a,left,center,start,end);
int rightSum=maxSubSum(a,center+1,right,start,end);
int s1=0;
int lefts=0;
for(int i=center;i>=left;i--)
{
lefts+=a[i];
if(lefts>s1)
{
s1=lefts;
start=i;
}
}
int s2=0;
int rights=0;
for(int i=center;i<=right;i--)
{
lefts+=a[i];
if(rights>s2)
{
s2=rights;
end=i;
}
}
sum=s1+s2;
if(sum
sum=leftSum;
if(sum
sum=rightSum;
}
return sum;
}
int maxSum(int *a,int n,int &start,int &end)
{
return maxSubSum(a,0,n,start,end);
}
int main()
{
int number;
cin>>number;
for(int j=1;j<=number;j++)
{
int n,start,end,maxsum;
cin>>n;
int *a=new int[n];
for(int i=0;i
{
cin>>a[i];
}
// for(int i=0;i
// {
// int thisSum=0;
// for(int k=i;k
// {
// thisSum+=a[k];
// if(thisSum>maxSum)
// {
// maxSum=thisSum;
// start=i;
// end=k;
// }
// }
// }
maxsum=maxSum(a,n-1,start,end);
cout<
cout<
if(j!=number)
cout<
else