Maximum Subsequence Sum (25)

Maximum Subsequence Sum (25)

时间限制 1000 ms 内存限制 32768 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小)
题目描述
Given a sequence of K integers { N1, N2, …, NK }. A continuous subsequence is defined to be { Ni, Ni+1, …, Nj } where 1 <= i <= j <= K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its
elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its
maximum subsequence is { 11, -4, 13 } with the largest sum being 20.
Now you are supposed to find the largest sum, together with the first
and the last numbers of the maximum subsequence.

输入描述:
Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer K (<= 10000). The second line contains K numbers, separated by a space.

输出描述:
For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices i and j (as shown by the sample case). If all the K numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.

输入例子:
10
-10 1 2 3 4 -5 -23 3 7 -21

输出例子:
10 1 4

题解：题意是给出一个数字序列，a1..a2….an 求i,j 使得ai+…aj最大，输出最大和 以及ai，aj.

要是枚举i,j需要O(n2)的复杂度，计算又需要n的复杂度所以总的复杂度为o(n3)
要是采用前缀和的话，A[i]+A[j]=S[j]-S[i-1] 使得计算时间变为o(1)，但是总的复杂度仍然为o(n3)
采用动态规划，dp[i]表示以A[i]结尾的连续序列的最大和，设置dp[]数组，即是求数组的最大值。
以A[i]结尾的连续序列，只有两种情况:
(1): 最大连续序列只有1个元素，以A[i]结尾
(2):最大和是dp[i-1]+A[i]
所以得到状态转移方程，dp[i]=max(A[i],dp[i-1]+A[i])
要输出具体的下标即可

#include<bits/stdc++.h>
using namespace std;
const int maxn=10001;
int a[maxn],dp[maxn];
int main()
{
    int n,m,start,end,s,e,flag=0;
    cin>>n;
    for (int i = 0; i < n; ++i)
    {
        cin>>a[i];
        if(a[i]>=0) flag=1;
    }
    if(flag==0)
    {
        cout<<0<<" "<<a[0]<<" "<<a[n-1]<<endl;
        return 0;
    }
    m=dp[0]=a[0];
    start=end=s=e=0;
    for (int i = 1; i < n; ++i)
    {
            if(a[i]>(dp[i-1]+a[i]))
            {
                dp[i]=a[i];
                s=e=i;

            }
            else
            {
                dp[i]=dp[i-1]+a[i];
                e=i;
            }
            if(m<dp[i])
            {

                m=dp[i];
                start=s;
                end=e;
            }
        }
        cout<<m<<" "<<a[start]<<" "<<a[end]<<endl;
        return 0;
    }