动态规划求最大子段和

#include<iostream>
using namespace std;
int MaxSum(int n,int a[]){
int sum=0;
int 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;
}
int main(){
int n,a[100],m,maxsum;
cout<<"请输入整数序列的元素个数n:"<<endl;
cin>>n;
cout<<"请输入序列中各元素的值a[i](一共"<<n<<"个)"<<endl;
for(m=0;m<n;m++)
cin>>a[m];
int b[100];
for(m=0;m<n;m++)
b[m+1]=a[m];
maxsum=MaxSum(n,b);
cout<<"整数序列的最大子段和是："<<maxsum<<endl;
system("pause");
}