数据结构（学习002天）给n个数求和

#include<stdio.h>
int main()//复杂度n^3
{
	int N=6,j=0;
	int MaxSubseqSum1(int A[], int N);
//	scanf("%d", &N);
	int A[10]={-2,11,-4,13,-5,-2};
	j=MaxSubseqSum1(A, N);
	printf("%d", j);
	return 0;
}
int MaxSubseqSum1(int A[], int N)
{
	int MaxSum=0,ThisSum=0,i,j,k;
	for (i=0;i<N;i++)
	{
		for (j=i;j<N;j++)/* i是子列左端位置 */
		{
			ThisSum=0; /* ThisSum是从A[i]到A[j]的子列和 */
			for (k=i;k<=j;k++) 
				ThisSum+= A[k];
			if (ThisSum>MaxSum)//int A[10]={-2,11,-4,13,-5,-2}
				MaxSum=ThisSum;
		}
	}
	return MaxSum;
}

#include<stdio.h>
int main()//复杂度n^2
{
	int N=6,j=0;
	int A[6]={-2,11,-4,13,-5,-2};
	int MaxSubseqSum1(int A[], int N);
	j=MaxSubseqSum1(A,N);
	printf("%d",j);
	return 0;
 } 
int MaxSubseqSum1(int A[], int N)
{
	int MaxSum=0,ThisSum=0,i,j,k;
	for(i=0;i<N;i++)/* i是子列左端位置 */
	{
		ThisSum=0; /* ThisSum是从A[i]到A[j]的子列和 */
		for(j=i;j<N;j++)/* j是子列右端位置 */
		{	
			ThisSum+=A[j]; /*对于相同的i，不同的j，只要在j-1次循环的基础上累加1项即可*/ 
			if(MaxSum<ThisSum)/* 如果刚得到的这个子列和更大 */
				MaxSum=ThisSum;  /* 则更新结果 */
		} /* j循环结束 */    
	} /* i循环结束 */    
	return MaxSum;
}

int Max3( int A,int B,int C)
{/*返回3个整数中的最大值*/
	return A>B?A>C?A:C:B>C?B:C;
}
int DivideAndConquer( int List[],int left,int right)
{ /*分治法求List[left]到List[right]的最大子列和*/
	int MaxLeftSum,MaxRightSum; /*存放左右子问题的解*/
	int MaxLeftBorderSum,MaxRightBorderSum; /*存放跨分界线的结果*/
	int LeftBorderSum,RightBorderSum;
	int center,i;
		if(left==right){ /*递归的终止条件,子列只有1个数字*/
			if(List[left]>0)
			 return List[left];
		else return 0;
		}
		/*下面是"分"的过程*/
	center=(left+right)/2; /*找到中分点*/
	/*递归求得两边子列的最大和*/
	MaxLeftSum=DivideAndConquer(List,left,center);
	MaxRightSum=DivideAndConquer(List,center+1,right);
	/*下面求跨分界的最大子列和*/
	MaxLeftBorderSum=0; LeftBorderSum= 0;
	for(i=center; i>=left; i--){ /*从中线向左扫描*/
	LeftBorderSum+=List[i];
	if(LeftBorderSum>MaxLeftBorderSum)
	MaxLeftBorderSum= LeftBorderSum;
	}/*左边扫描结束*/
	MaxRightBorderSum=0;RightBorderSum=0; 
	for(i=center+1; i<=right;i++){ /*从中线向右扫描*/
	RightBorderSum+=List[i];
	if( RightBorderSum >MaxRightBorderSum)
	MaxRightBorderSum = RightBorderSum;
	} /*右边扫描结束*/
/*下面返回"治"的结果*/
return Max3(MaxLeftSum,MaxRightSum,MaxLeftBorderSum+MaxRightBorderSum);
}
int MaxSubseqSum3(int List[],int N)
{ /*保持与前2种算法相同的函数接口*/
return DivideAndConquer(List,0, N-1);
}

#include<stdio.h>
int main()
{
	int N,j=0;
	int MaxSubseqSum1(int A[], int N);
	scanf("%d",&N);
	int A[N];
    for(int i=0;i<N;i++)
        scanf("%d",&A[i]);
	j=MaxSubseqSum1(A,N);
	printf("%d",j);
	return 0;
}
int MaxSubseqSum1(int A[], int N)
{
	int MaxSum=0,ThisSum=0,i;
	for(i=0;i<N;i++)
	{
		ThisSum+=A[i];
		if(ThisSum>MaxSum)
			MaxSum=ThisSum;
		else if(ThisSum<0)
			ThisSum=0;
	}    
	return MaxSum;
}