最大整数段的和

//Algorithm analysis:

#include<stdio.h>

int max_sub_sum(int a[],int left,int right)

{

int center,i,left_sum,right_sum,s1,s2,lefts,rights;

if(left==right)

if(a[left]>0)

return a[left];

else 

return 0;

else{

center=(left+right)/2;//分治

left_sum=(max_sub_sum(a,left,center));//左边最大的整数段和

right_sum=(max_sub_sum(a,center+1,right));//右边最大的整数段和

s1=0;

lefts=0;

for(i=center;i>=left;--i)//计算a[left,center]的最大值

{

lefts=lefts+a[i];

if(lefts>s1)

s1=lefts;

}

s2=0;

rights=0;

for(i=center+1;i<=right;++i)//计算a[center，right]的最大值

{

rights=rights+a[i];

if(rights>s2)

s2=rights;

}

if((s1+s2<left_sum)&&(right_sum<left_sum))

return left_sum;

if(s1+s2<right_sum)

return right_sum;

return (s1+s2);

}

}

int max_sum3(int a[],int n)

{

return (max_sub_sum(a,0,n-1));

}

int main()

{

int a[100];

int n;

int integer;

printf("please input a string integer(end whit 0):");

for(n=0;;++n)

{

scanf("%d",&integer);

if(integer!=0)

a[n]=integer;

else break;

}

printf("The biggest integers total is:%d\n",max_sum3(a,n));

return 0;

}