动态规划——最大字段和

给定n个整数（可能为负数）组成的序列X,求该序列如x[i]+x[i+1]+…+x[j]的子段和的最大值。当所给的整数均为负数时定义子段和为0，依此定义，所求的最优值为： Max{0,x[i]+x[i+1]+…+x[j]},1<=i<=j<=n

输入：序列X

输出：最大子段和

1枚举法

#include<iostream> 
using namespace std;


int maxSum(int n, int a[], int &besti, int &bestj){
	
	int sum = 0;
	for(int i= 0; i < n; i++)	{
		
		int thisSum = 0;
		for(int j = i; j < n; j++){
			
			thisSum += a[j];
			if(thisSum > sum){
			
				sum = thisSum;
				besti = i;
				bestj = j;
			}
		}
		
	}
	return sum;
}

int main(){
	
	int a[] = {-2,11,-4,13,-5,-2,};
 
	for(int i=0; i<6; i++)
	{
		cout<<a[i]<<" ";
	}
	
	int besti,bestj;
	 
	cout<<endl;
	cout<<"数组a的最大连续子段和为：a["<<besti<<":"<<bestj<<"]:"<<maxSum(6,a,besti,bestj)<<endl;
	
	return 0;
}

从这个算法的3个for循环可以看出，它所需的计算时间是O(n*n*n)。 

2分治算法

 

#include<iostream>
using namespace std;

int maxSubSum(int a[], int left, int right){

	int sum = 0;
	if(left == right){
		sum = a[left]>0 ? a[left] : 0;
	}
	else{
		
		int center = (left + right) / 2;
		int leftSum = maxSubSum(a, left, center);
		int rightSum = maxSubSum(a, center + 1, right);

		int s1 = 0;
		int lefts = 0;
		for(int i = center; i >= left; i--){
			
			lefts += a[i];
			if(lefts > s1) s1 = lefts;
		}
	
		int s2 = 0;
		int rights = 0;
		for(int i = center + 1; i < right; i++){
			
			rights += a[i];
			if(rights > s2)	s2 = rights;
		}
		sum = s1 + s2;
		if(sum < leftSum) sum = leftSum;	
		if(sum < rightSum) sum = rightSum;
	}
	return sum;
}

int maxSum(int a[], int n){
	return maxSubSum(a, 0, n - 1);
}

int main(){
	
	int a[] = {-2,11,-4,13,-5,-2,};
 //           left             right
	for(int i= 0; i < 6; i++)
	{
		cout<<a[i]<<" ";
	}	 
	cout<<endl;
	cout<<"数组a的最大连续子段和为：" << maxSum(a, 6)<<endl;
	return 0;
}

该算法所需计算时间为O(nlogn) 。

3动态规划算法

#include<iostream>
using namespace std;

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

int main(){
	
	int a[] = {-2,11,-4,13,-5,-2,6};

	for(int i= 0; i < 7; i++)
	{
		cout<<a[i]<<" ";
	}	 
	cout<<endl;
	cout<<"数组a的最大连续子段和为：" << maxSum(a, 7)<<endl;
	return 0;
}

 上述算法显然只需计算时间O(n)空间。