小刘的周记第八周之动态规划算法

任务：使用枚举、分治及动态规划三种算法实现最大子段和问题。

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

输入：序列X

输出：最大子段和

代码：

#include <iostream>
#include <string>
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 MaxSubSum(int *a, int left, int right)
{
    int sum=0;
    if(left==right)
        sum=a[left]>0?a[left]:0; 
    else{
        int mid=(left+right)/2;
        int leftsum=MaxSubSum(a,left,mid);
        int rightsum=MaxSubSum(a,mid+1,right); 
        int sum1=0, lefts=0;
        for(int i=mid;i>=left;i--){
            lefts+=a[i];
            if(lefts>sum1)
                sum1=lefts;
        }
        int sum2=0,rights=0;
        for (int i=mid+1;i<=right;i++){
            rights+=a[i];
            if(rights>sum2)
                sum2=rights;
        }
        sum=sum1+sum2;
        if (sum<leftsum)
            sum=leftsum;
        if (sum<rightsum)
            sum=rightsum;
    }
    return sum;
}
//动态规划 
int MaxSum2(int n, int *a)
{
    int sum=0, temp=0;
    for(int i=0;i<n;i++){
        if(temp>0)
            temp+=a[i];
        else
            temp=a[i];
        if(temp>sum)
            sum=temp;
    }
    return sum;
}
int main(){
	int a[]={0,13,-3,-25,20,-3,-16,-23,18,20,-7,12,-5,-22,15,-4,7,-9,4,8,1,4,-5,-2,1,-3,6,8,-18,9};
    int besti=0,bestj=0;
    cout<<"枚举：sum="<<MaxSum(30,a,besti,bestj)<<endl;
    cout<<"分治：sum="<<MaxSubSum(a,0,29)<<endl;
    cout<<"动态规划：sum="<<MaxSum2(30,a)<<endl;
    cout<<"besti="<<besti<<" "<<"bestj="<<bestj<<endl;
    return 0;
}

运行结果：