最大子序列和的接口函数（3）

int MaxSubsequenceSum(const int A[],int N)
{
	int thisSum=0,MaxSum=0,j;

	for(j=0;j<N;j++)
	{
		thisSum+=A[j];
		printf("thisSum %d..A[%d]=%dn",thisSum,j,A[j]);			
		if(thisSum>MaxSum)
		{
			MaxSum=thisSum;
			printf("MaxSum:%dn",MaxSum);
		}
		else if(thisSum<0)
			thisSum=0;	
	}
	return MaxSum;
}
int main()
{
	int number[]={1,-1,3,4};
	int maxsum=0;
	
	printf("start ....n");	
	maxsum=MaxSubsequenceSum(number,4);
	printf("maxsum:%dn",maxsum);	
	exit(0);
}

start ....
thisSum 1..A[0]=1
MaxSum:1
thisSum 0..A[1]=-1
thisSum 3..A[2]=3
MaxSum:3
thisSum 7..A[3]=4
MaxSum:7
maxsum:7