蛮力法分治法动态规划法求最大子段和

最大子段实验：
#include<iostream.h>
int MaxSum1(int a[],int n){//蛮力法
  int sum=0;
  int i,j,k;
  for(i=1;i<=n;i++){
  int asum=0;
  for(j=i;j<=n;j++)
  {
          asum+=a[j];
  if(asum>sum)
  {
             sum=asum;
  }
  }
  }
  return sum;
}
void main(){
   int n,a[100],m,i,j,maxsum;
   cout<<"请输入整数序列的元素个数："<<endl;
   cin>>n;
   cout<<"请输入各元素的值："<<endl;
   for(m=1;m<=n;m++)
   cin>>a[m];
       maxsum=MaxSum(a,n,i,j);
   cout<<"最大子段和是："<<maxsum<<endl;
}

******************