#include<stdio.h>
int MaxSubSum(int a[],int n)
{
int i,j;
int seqstart,seqend;
int maxsum,thissum;
for(i=0;i<n;i++)
{
thissum = 0;
for(j=i;j<n;j++)
{
thissum += a[j];
if(thissum>maxsum)
{
maxsum = thissum;
seqstart = i;
seqend = j;
}
else
if(thissum<0)
{
i = j+1;
thissum = 0;
}
}
}
return maxsum;
}
void main()
{
int i;
int a[10];
printf("input ten number:/n");
for(i=0;i<10;i++)
{
scanf("%d",&a[i]);
}
printf("%d",MaxSubSum(a,10));
}
最大子序列
最新推荐文章于 2023-12-09 11:37:09 发布