怎么输出最大字段和序列没想出来最好是分治法的。
#include<bits/stdc++.h>
using namespace std;
int MaxSum(int a[],int left,int right)
{
int sum=0;
if(left==right)
{
if(a[left]>0)sum=a[left];
else sum=0;
}
else
{
int center=(left+right)/2;
int leftsum=MaxSum(a,left,center);
int rightsum=MaxSum(a,center+1,right);
int s1=0;int lefts=0;
for(int i=center;i>=left;i--)
{
lefts+=a[i];
if(lefts>s1)s1=lefts;
}
int s2=0;int rights=0;
for(int j=center+1;j<=right;j++)
{
rights+=a[j];
if(rights>s2)s2=rights;
}
sum=s1+s2;
if(sum<leftsum)sum=leftsum;
if(sum<rightsum)sum=rightsum;
}
return sum;
}
int main()
{
int n,a[100],i;
cout<<" 输入序列长度:";
scanf("%d",&n);
cout<<" 原有序列:";
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
int b=MaxSum(a,0,n-1);
cout<<" 该序列字段最大的和为："<<b;
}
要求还要能输出最大子段和序列
https://blog.csdn.net/qq_41110241/article/details/85317079
cankao