PAT (Advanced Level) 甲级 1007 Maximum Subsequence Sum

最新推荐文章于 2024-10-01 23:05:47 发布

雨中纸鸢943

最新推荐文章于 2024-10-01 23:05:47 发布

阅读量194

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/qq_61793850/article/details/132305753

版权

点此查看所有题目集

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.

Input Specification:

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.

Output Specification:

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.

这题求解的是最大连续子序列问题，在动态规划中比较常见，但是在这里，我没有使用动态规划，用的是在线处理这个方法，每次只要是大于0的，那就说明可以继续变大，然后最大值就会在每次的叠加中产生，然后找到最大值后，需要记录那个下标。里面也有好几个易错点。比如他要求首尾的序列要尽可能小，而且输出的是值，并不是坐标，这个就比较坑，如果没看出来，样例都看不懂。同时假如全为0，和0与负数相结合这两种情况还是有区别的，也要着重处理。

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int N;cin >> N;
    int a = 0,b = 0, sum = 0;
    int mx = 0;
    vector<int>v;
    for(int i = 0;i<N;i++)
    {
        int x;cin >> x;
        v.push_back(x);
        if(sum+x>=0) 
        {
            sum+=x;
        }else {
            sum = 0;
        }
        if(sum>mx || (x==0 && b==0))
        {
            b = i;
        }
        // cout << x <<" "<<sum<<"\n";
        mx = max(sum,mx);
        
    }
    int sm = 0;
    for(int i = b;i>=0;i--)
    {
        sm+=v[i];
        if(sm==mx) 
        {
            // cout << sm << " "<<i<<"\n";
            a = i;
        }
    }
    if(mx==0 && b==0)
    {
        a = 0;
        b = N-1;
    }
    cout << mx<<" "<<v[a] <<" "<<v[b];
    return 0;
}