最大m子段和问题
#include<iostream>
using namespace std;
int maxsum(int m,int n,int *x)
{
if(n<m||m<1) return 0;
int *b=new int [n+1];
int *c=new int [n+1];
b[0]=0;c[1]=0;
for(int i=1;i<=m;i++)
{
b[i]=b[i-1]+x[i];
c[i-1]=b[i];
int max=b[i];
for(int j=i+1;j<=i+n-m;j++)
{
b[j]=b[j-1]>c[j-1]?b[j-1]+x[j]:c[j-1]+x[j];
c[j-1]=max;
if(max<b[j])max=b[j];
}
c[i+n-m]=max;
}
int sum=0;for(int j=m;j<=n;j++)
if(sum<b[j])sum=b[j];
return sum;
}
int main()
{
int n,m;
int x[100];
while(cin>>m>>n)
{
for(int i=1;i<=n;i++)
{
cin>>x[i];
}
cout<<maxsum(m,n,x)<<endl;
}
}
#include<iostream>
using namespace std;
int maxsum(int m,int n,int *x)
{
if(n<m||m<1) return 0;
int *b=new int [n+1];
int *c=new int [n+1];
b[0]=0;c[1]=0;
for(int i=1;i<=m;i++)
{
b[i]=b[i-1]+x[i];
c[i-1]=b[i];
int max=b[i];
for(int j=i+1;j<=i+n-m;j++)
{
b[j]=b[j-1]>c[j-1]?b[j-1]+x[j]:c[j-1]+x[j];
c[j-1]=max;
if(max<b[j])max=b[j];
}
c[i+n-m]=max;
}
int sum=0;for(int j=m;j<=n;j++)
if(sum<b[j])sum=b[j];
return sum;
}
int main()
{
int n,m;
int x[100];
while(cin>>m>>n)
{
for(int i=1;i<=n;i++)
{
cin>>x[i];
}
cout<<maxsum(m,n,x)<<endl;
}
}