1007. Maximum Subsequence Sum (25)

题目：1007. Maximum Subsequence Sum (25)

github-PAT1007

/*
题目地址：https://www.patest.cn/contests/pat-a-practise/1007
作为一道经典的题目，这里列出三种解法
方法一，暴力求解，嵌套两次循环，复杂度（o(n^2)）
`+``
#include <bits/stdc++.h>
using namespace std;
int maxsum=0x80000000,L,R;
void maxSubseqSum(vector<int> &nums)
{
    int n=nums.size();
    for(int i=0;i<n;++i)
    {
        int cursum=0;
        for(int j=i;j<n;++j)
        {
            cursum+=nums[j];
            if(cursum>maxsum)
            {
                maxsum=cursum;
                L=i;
                R=j;
            }
        }
    }
}
int main()
{
    vector<int> nums;
    int n;
    scanf("%d",&n);
    while(n--)
    {
        int x;
        scanf("%d",&x);
        nums.push_back(x);
    }
    maxSubseqSum(nums);
    if(maxsum<0)
    {
        maxsum=0;
        L=0;R=nums.size()-1;
    }
    printf("%d %d %d\n",maxsum,nums[L],nums[R]);
    return 0;
}
`+``
方法二，分治求解，复杂度（o(nlogn)）
`+``
#include <bits/stdc++.h>
using namespace std;
struct node
{
    int left,right;
    int sum;
    node(int l,int r,int s):left(l),right(r),sum(s){}
};
node maxval(const node &a,const node &b)
{
    if(a.sum>b.sum||(a.sum==b.sum&&a.left<b.left))
        return a;
    return b;
}
node crossSubseqSum(vector<int> &nums,int left,int right,int mid)
{
    int lmax=0x80000000,rmax=0x80000000;
    int sum=0,l,r;
    for(int i=mid;i>=left;--i)
    {
        sum+=nums[i];
        if(sum>lmax)
        {
            lmax=sum;
            l=i;
        }
    }
    sum=0;
    for(int i=mid+1;i<=right;++i)
    {
        sum+=nums[i];
        if(sum>rmax)
        {
            rmax=sum;
            r=i;
        }
    }
    return node(l,r,lmax+rmax);
}
node maxSubseqSum(vector<int> &nums,int left,int right)
{
    if(left==right) return node(left,right,nums[left]);
    int mid=(left+right)/2;
    node l=maxSubseqSum(nums,left,mid);
    node r=maxSubseqSum(nums,mid+1,right);
    node m=crossSubseqSum(nums,left,right,mid);
    return maxval(maxval(l,r),m);
}
int main()
{
    vector<int> nums;
    int n;
    scanf("%d",&n);
    while(n--)
    {
        int x;
        scanf("%d",&x);
        nums.push_back(x);
    }
    node ret=maxSubseqSum(nums,0,nums.size()-1);
    if(ret.sum<0)
    {
        ret.sum=0;
        ret.left=0;
        ret.right=nums.size()-1;
    }
    printf("%d %d %d\n",ret.sum,nums[ret.left],nums[ret.right]);
    return 0;
}
`+``
方法三：dp，复杂度（o(n)）
`+``
#include <bits/stdc++.h>
using namespace std;
struct node
{
    int left,right;
    int sum;
    node(int l,int r,int s):left(l),right(r),sum(s){}
};
node maxSubseqSum(vector<int> &nums)
{
    int n=nums.size();
    node maxsum(-1,-1,0x80000000);
    node cursum(0,0,0);
    for(int i=0;i<n;++i)
    {
        cursum.sum+=nums[i];
        cursum.right=i;
        if(cursum.sum>maxsum.sum) maxsum=cursum;
        if(cursum.sum<0) cursum=node(i+1,i+1,0);
    }
    return maxsum;
}
int main()
{
    vector<int> nums;
    int n;
    scanf("%d",&n);
    while(n--)
    {
        int x;
        scanf("%d",&x);
        nums.push_back(x);
    }
    node ret=maxSubseqSum(nums);
    if(ret.sum<0)
    {
        ret.sum=0;
        ret.left=0;
        ret.right=nums.size()-1;
    }
    printf("%d %d %d\n",ret.sum,nums[ret.left],nums[ret.right]);
    return 0;
}
`+``
以下采用o(n)复杂度
*/

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    vector<int> nums;
    scanf("%d",&n);
    nums.resize(n);
    for(int i=0;i<n;++i)
        scanf("%d",&nums[i]);
    int cur_l=0,cur_r=0,cursum=0;
    int l=0,r=0,maxsum=0x80000000;
    for(int i=0;i<n;++i)
    {
        cursum+=nums[i];
        cur_r=i;
        if(cursum>maxsum)
        {
            maxsum=cursum;
            l=cur_l;
            r=cur_r;
        }
        if(cursum<0)
        {
            cursum=0;
            cur_l=cur_r=i+1;
        }
    }
    if(maxsum<0)maxsum=0,l=0,r=n-1;
    printf("%d %d %d\n",maxsum,nums[l],nums[r]);
    return 0;
}