1007 Maximum Subsequence Sum

最新推荐文章于 2024-04-07 19:11:29 发布

倾鸢染

最新推荐文章于 2024-04-07 19:11:29 发布

阅读量134

点赞数

分类专栏：刷题题解文章标签： Maximum Subsequence Sum 1007

本文链接：https://blog.csdn.net/qq_41895427/article/details/100144557

版权

刷题题解专栏收录该内容

23 篇文章 0 订阅

订阅专栏

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

Sample Input:
10
-10 1 2 3 4 -5 -23 3 7 -21
Sample Output:
10 1 4

题目意思
给你一个数组，问这个数组组成的所有子串中，哪个子串的和最大，输出这个和，并且输出这个子串的第一个数和最后一个数。

特殊情况

当整个数组全是负数的情况下，输出0和数组的第一个数和最后一个数。
至少有一个数为0，其他为负数时，输出0 0 0.

代码

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;

long long int sum=-999999999,num;

int main()
{
    int n,hx[10003],flag=0;
    scanf("%d",&n);
    for(int i=0; i<n; i++)
    {
        scanf("%d",&hx[i]);
        if(hx[i]<0)
            flag++;
    }
    if(flag==n)
    {
        printf("0 %d %d\n",hx[0],hx[n-1]);
    }
    else
    {
        int start,End;
        for(int i=0; i<n; i++)
        {
            num=0;
            for(int j=i; j<n; j++)
            {
                num =num+hx[j];
                if(num>sum)
                {
                    sum=num;
                    start=hx[i];
                    End=hx[j];
                }
            }
        }
        if(sum==0)
            printf("0 0 0\n");
        else
            printf("%lld %d %d\n",sum,start,End);
    }

    return 0;
}