PAT甲级1007 Maximum Subsequence Sum（前缀和做法)

前言

PAT 1007 一道前缀和的模板题目.

题目概述

1007 Maximum Subsequence Sum

Given a sequence of K integers { N1, N2, …, N**K }. A continuous subsequence is defined to be { N**i, N**i+1, …, N**j } 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.

Sample Input:

10
-10 1 2 3 4 -5 -23 3 7 -21

Sample Output:

10 1 4

AC代码

#include<iostream>
using namespace std;

const int N = 1e4 + 10;

int s[N], a[N];

int main()
{
    int n;
    cin >> n;
    
    for(int i = 1; i <= n; ++i)
    {
        cin >> a[i];
        s[i] = s[i - 1] + a[i];
    }
    
    int l = 0, r = 0, cnt = -1e9;
    for(int i = 1; i <= n; ++i)
        for(int j = i; j <= n; ++j)
        {
            if(cnt < s[j] - s[i - 1])
            {
                l = i;
                r = j;
                cnt = s[j] - s[i - 1];
            }
        }
    
    if(cnt < 0) cnt = 0, l = 1, r = n;
    cout << cnt << " " << a[l] << " " << a[r] << endl;
    return 0;
}

分析思路

1.这道题目的做法应该有很多，考虑到数据规模1e4，所以O方的做法勉强能够接受。这道题目是能够跑过的。

2.读入的时候预处理出s[i]表示前i项的和，那么从l到r的区间的和即为S[n] - s[l -1]；

3.最后判断一下是不是负的。

文末广告

学习算法和数据结构真的是个很累的过程，不会做只能求助于题解。 因为写代码这个东西基本上是千人千面。同时网络上搜到的题解很多要么用到的是自己还没学到的知识，看不懂;要么内核过于简陋，只能糊弄当前题目，不具有普适性。
如果你是一个喜欢做洛谷，ACwing和PTA的题目的同学，欢迎关注我的博客，我主要在这三个平台上做题，认为有价值和有难度的题目我会写题解发布出来。
TreeTraverler的往期文章