题目:输入一个有N个元素的一位数组(N通过输入确定),这个数组当然有很多子数组,求最大的子数组之和并求出最大子数组的位置。
以下是一个我写的程序:
#include
#include
#include
int InputArray(int* &a,int ArrayLength)
{
printf("Please Input the Array Members:\n");
for(int i=0; i< ArrayLength; i++)
scanf("%d",&a[i]);
}
int MaxSum(int a[], int n, int &StartFlag, int &EndFlag)
{
int nStart,nAll;
nStart = a[n-1];
nAll = a[n-1]; //Record the final MaxSum of SubArray
for(int j=n-2; j>=0; j--)
{
if( EndFlag >= StartFlag )
{ if(nStart < 0)
{
nStart = 0;
EndFlag = j;
}
nStart += a[j];
if( nStart > nAll)
{
nAll = nStart;
StartFlag = j;
}
if( EndFlag < StartFlag)
EndFlag = StartFlag;
}
}
return nAll;
}
int main()
{
int Choose,Flag=1;
while(Flag)
{
printf("Please choose your operation: \n");
printf("Excise Input 1, Exit input 2\n");
scanf("%d",&Choose);
if(Choose==1)
{
int *a, ArrayLength;
printf("Please Input the Array Size:\n");
scanf("%d",&ArrayLength);
a = (int*)malloc(ArrayLength*sizeof(int));
InputArray(a,ArrayLength);
int StartFlag=0;
int EndFlag = ArrayLength-1;
printf("The MaxSum sub of Array is %d:\n",MaxSum(a, ArrayLength, StartFlag, EndFlag) );
printf("The Max SubArray is From %d to %d.\n",StartFlag,EndFlag);
getch();
free(a);
}
if(Choose==2) Flag=0;
}
return 0;
}