最大子段和问题

#include

int MaxSum(int n,int *a){
	int sum = 0;
	int b = 0,i;
	for(i=0;i0) {
			b+=a[i];
		}else
			b = a[i];
		if (b>sum) {
			sum = b;
		}
	}
	return sum;
}

int MaxSumArray(int m,int n,int a[][15]){
	int sum = 0;
	int i,j,k;
	int b[105];
	for(i=0;i