最大字段和

离陌殇殃

于 2024-12-09 08:30:00 发布

阅读量292

点赞数 2

文章标签：算法 c++ 数据结构

本文链接：https://blog.youkuaiyun.com/qq_67605201/article/details/144325476

版权

四、实验过程及主要代码

#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;using namespace std;

            }

        }

        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 main()

{

    int n;

    cout<<"请输入需要输入的元素的个数："<<endl;

    cin>>n;

    int a[n];

    cout<<"请输入"<<n<<"个元素："<<endl;

    for(int i=0; i<n; i++)

        cin>>a[i];

    cout<<"最大子段和为:"<<MaxSubSum(a, 0, n-1)<<" ";

}