HDU 1003 Max Sum

最新推荐文章于 2022-03-03 08:27:19 发布

木木叶晓

最新推荐文章于 2022-03-03 08:27:19 发布

阅读量301

点赞数

分类专栏： ACM习题本

本文链接：https://blog.csdn.net/sume520/article/details/54387096

版权

ACM习题本专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Problem Description

Given a sequence a[1],a[2],a[3]……a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.

Input The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).

Output For each test case, you should output two lines. The first line is “Case #:”, # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.

Sample Input 2 5 6 -1 5 4 -7 7 0 6 -1 1 -6 7 -5

Sample Output Case 1: 14 1 4

Case 2: 7 1 6

#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
    int x, n, t, sum, max, a, y, count = 1, X, Y;
    cin >> t;
    while (t--)
    {
        sum = max = -1001;
        cin >> n;
        for (int i = 1; i <= n; i++)
        {
            cin >> a;
            if (sum + a < a)
                sum = a, x = y = i;
            else
                sum += a, ++y;
            if (max < sum)
                max = sum, X = x, Y = y;
        }
        printf("Case %d:\n%d %d %d\n",count++, max, X, Y);
        if (t)
            cout << endl;
    }
    return 0;
}