5第五题四种算法求最大子序列.docVIP

//计算最大子序列函数 #includestdio.h #includetime.h #includestdlib.h #define MAX 999 //求最大子序列-第四种方法 int MaxSubsequenceSum4( int *a, int *b, int *e ) { int i; int ThisSum,MaxSum; *b=*e=0; ThisSum=MaxSum=0; for( i=1; i=a[0]; i++ ) { ThisSum+=a[i]; if( ThisSum0 ) { *b=i+1; ThisSum=0; } else if( ThisSumMaxSum ) { *e=i; MaxSum=ThisSum; putchar($);// } } return MaxSum; } //求最大子序列-第三种方法 int MaxSubSum( int *a, int left, int right ) { int medium,i; int MaxSum,MaxLeftSum,MaxRightSum; int MaxLeftBorderSum,MaxRightBorderSum,MaxBorderSum; int LeftBorderSum,RightBorderSum; if( left==right ) if( a[left]0 ) return 0; else return a[left]; medium=(left+right)/2; MaxLeftSum=MaxSubSum(a,left,medium); MaxRightSum=MaxSubSum(a,medium+1,right); MaxLeftBorderSum=LeftBorderSum=0; for( i=medium; i=left; i-- ) { LeftBorderSum=LeftBorderSum+a[i]; if( LeftBorderSumMaxLeftBorderSum ) { putchar(#);// MaxLeftBorderSum=LeftBorderSum; } } MaxRightBorderSum=RightBorderSum=0; for( i=medium+1; i=right; i++ ) { RightBorderSum+=a[i]; if( RightBorderSumMaxRightBorderSum ) { putchar(#);// MaxRightBorderSum=RightBorderSum; } } MaxSum=0; MaxBorderSum=MaxRightBorderSum+MaxLeftBorderSum; MaxSum= MaxLeftSumMaxRightSum ? MaxLeftSum : MaxRightSum; MaxSum= MaxSumMaxBorderSum ? MaxSum : MaxBorderSum; return MaxSum; } int MaxSubsequenceSum3( int *a ) { return MaxSubSum( a,1,a[0] ); } //求最大子序列-第二种方法 int MaxSubsequenceSum2( int *a, int *b, int *e ) { int i,j; int ThisSum,MaxSum; *b=*e=0; ThisSum=MaxSum=0; for( i=1; i=a[0]; i++ ) { ThisSum=0; for( j=i; j=a[0]; j++ ) { ThisSum+=a[j]; if( ThisSumMaxSum ) { *b=i,*e=j; MaxSum=ThisSum; putchar(@);// } } } return MaxSum; } //求最大子序列-第一种方法 int MaxSubsequenceSum1( int *a, int *b, int *e ) { int i,j,k; int ThisSum,MaxSum; *b=*e=0; ThisSum=MaxSum=0; for( i=1; i=a[0]; i++ ) for( j=1; j=a[0]; j++ ) { ThisSum=0; for( k=i; k=j; k++ )