给定由n个整数(可能有负整数)组成的序列(a1,a2,…,an),最大子段和问题要求该序列形如 的最大值(1<=i<=j<=n),当序列中所有整数均为负整数时,其最大子段和为0。
1) 用分治法求解。
#include<stdio.h>
int MaxSum(int a[],int left,int right);
int a[100];
int main()
{
int n,j;
scanf("%d",&n);
for(j=0;j<n;j++)
scanf("%d",&a[j]);
printf("%d\n",MaxSum(a,0,n-1));
return 0;
}
int MaxSum(int a[],int left,int right)
{
int sum=0,midSum=0,leftSum=0,rightSum=0;
int center,s1,s2,lefts,rights;
if(left==right)
sum=a[left];
else{
center=(left+right)/2;
leftSum=MaxSum(a,left,center);
rightSum=MaxSum(a,center+1,right);
s1=0;lefts=0;
for(int i=center;i>=left;i--)
{
lefts+=a[i];
if(lefts>s1) s1=lefts;
}
s2=0;rights=0;
for(int j=center+1;j<=right;j++)
{
rights+=a[j];
if(rights>s2) s2=rights;
}
midSum=s1+s2;
if(midSum<leftSum)
sum=leftSum;
else
sum=midSum;
if(sum<rightSum)
sum=rightSum;
}
return sum;
}
2) 用动态规划法求解。
#include<stdio.h>
int MaxSum(int n,int a[])
{
int sum=0,b=0;
for(int i=1;i<=n;i++)
{
if(b>0)
b+=a[i];
else
b=a[i];
if(b>sum)
sum=b;
}
return sum;
}
void main()
{
int a[100],n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
printf("%d\n",MaxSum(n,a));
}