7-1 最大子列和问题（四种方法完整代码）

四种方法均为陈越姥姥在课程中讲过的
在此总结

#include<stdio.h>
#define max 100000
int main(void){
	int n,i;
	int a[max]={0};
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}	
	printf("%d",MaxSubseqSum(a,n));调用函数
	return 0;
}
int MaxSubseqSum(int A[],int K){//单独定义函数
	int left=0;
	int right=0;
	int thatsum=0;
	int maxsum=0;
	int flag=0;
	for(left=0;left<K;left++)//子列的左边
	{
		for(right=left;right<K;right++)//子列的右边
		{
			thatsum=0;//每次取晚要把这个thatsum归0
			for(flag=left;flag<right;flag++)//计算左边到右边的和，取大的
			{
				thatsum=thatsum+A[flag];
				if(thatsum>maxsum)
				{
					maxsum=thatsum;
				}
			}
		}
	}
	return maxsum;//所有子列取大的返回
}

挺慢的也过不了全部测试点

因为在确定左边界，移动右边界的时候，每一个子列有重复部分

#include<stdio.h>
#define max 100000
int main(void){
	int n,i;
	int a[max]={0};
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}	
	printf("%d",MaxSubseqSum(a,n));
	return 0;
}
int MaxSubseqSum(int A[],int K){
	int left=0;
	int right=0;
	int thatsum=0;
	int maxsum=0;
		for(left=0;left<K;left++)
	{			
	    thatsum=0;
		for(right=left;right<K;right++)
		{
			thatsum=thatsum+A[right];
			if(thatsum>maxsum)
			{
				maxsum=thatsum;
			}
		}
	}
	return maxsum;
}

可以通过全部测试点

#include<stdio.h>
#define max 100000
int main(void){
	int n,i;
	int a[max]={0};
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}	
	printf("%d",MaxSubseqSum(a,n));
	return 0;
}
/*返回三个整数的最大值*/
int Max3 ( int A, int B, int C ) {
	return (A > B) ? (A > C ? A : C) : (B > C ? B : C);
}
/*分治法球List[left]到List[right]的最大子列和*/
int DivideAndConquer ( int List[], int left, int right ) {
	int MaxLeftSum, MaxRightSum;    //存放左右子问题的解。
	int MaxLeftBorderSum, MaxRightBorderSum;    //存放跨分界线的结果。
	
	int LeftBorderSum, RightBorderSum;
	int center, i;
	
    /*递归的终止条件*/
	if ( left == right ) {
		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 MaxSubseqSum ( int List[], int N ) {
	return DivideAndConquer ( List, 0, N-1 );
}

#include <stdio.h>
#define MAXN 100000    //本题最大数据是十万
int main() {
	int K, i;
	int a[MAXN] = {0};
	int thatsum=0;
	int maxsum=0;
	int j=0;
	scanf("%d", &K);
	for ( i = 0; i < K; i++ ){	
		scanf("%d", &a[i]);
	}
	for(j=0;j<K;j++)
	{
		thatsum=thatsum+a[j];
		if(thatsum<0)
		{
			thatsum=0;
		}
		else if(thatsum>maxsum)
		{
			maxsum=thatsum;
		}
	}
	printf("%d",maxsum);
}