/*
求最大子序列和
*/
#include <iostream>
#include <stdio.h>
using namespace std;
/*
常规方法。O(n^3)
在1……n的数组上,每次截取片段i……j,求其子序列和
*/
void getMaxSubSum(int *a,int n){
int max = -99999;
int maxi,maxj;
for(int i=0; i<n; i++){
for(int j=n-1;j>=i;j--){
int sum = 0;
for(int k=i;k<=j;k++){
sum += a[k];
if(max <= sum){
max = sum;
maxi = i;
maxj = j;
//cout << max << " " << sum << " "<< i << ","<< j<<endl;
}
}
}
}
printf("CommMax = %d,start=%d,end=%d\n",max,maxi+1,maxj+1);
}
/*
基于二分查找思想,数据大小N=2^x;
1.将集合分为两段,称为left,right
2.递归求解,left段得到leftMax,right段得rightMax;
3.最大子序列和也可能在两段之间,在两段之间求解,跨段求解,得到midMax;
4.比较leftMax,rightMax,midMax的大小求出最大子序列和;
时间复杂度:O(logN + (N/2)^3)
*/
int getMaxSubSumBin(int *a,int start,int end){
int halfNum = (end - start +1) / 2;
int max = -9999;
if(end <= start+1){
if(max <= a[start]){
max = a[start];
return max;
}
}else{
int leftMax = getMaxSubSumBin(a,start,start+halfNum);
if(max <= leftMax){
max = leftMax;
}
int rigthMax = getMaxSubSumBin(a,start+halfNum,end);
if(max <= rigthMax){
max = rigthMax;
}
}
int sum = 0;
for(int i=start; i<halfNum; i++){
int k;
for(int j=1; j<=halfNum; j++){
sum = 0;
for(k=i; k<halfNum+j; k++){
sum += a[k];
}
if(max <= sum){
max = sum;
}
}
}
//printf("start=%d,end=%d\n",maxi,maxj);
return max;
}
int main()
{
const int n = 8;
int a[n]={1,-3,2,5,-8 ,9,-10,30};
//int a[10]={1,2,3,4,5,6,7,7,8,9};
//int a[10]={1,2,3,4,5,6,7,7,8,-9};
getMaxSubSum(a,n);
cout <<"BinMax:" <<getMaxSubSumBin(a,0,n);
return 0;
}
求最大子序列和
最新推荐文章于 2022-10-12 03:43:00 发布