HDU1003Max Sum和HDU1231最大连续子序列

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

余人未至

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

阅读量232

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/qq_34624763/article/details/53054390

版权

动态规划专栏收录该内容

14 篇文章 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
   
   

   
   先定义最大值为一个极小的值，然后逐个加和判断是否大于最大值，若大于，将其赋值给最大值，若前面加和小于零，则将i + 1 (即下一个位置）定义为预备起始点，当加和大于最大值的时候，预备起始点才赋值给起始点
   
   
   
   #include <cstdio>
#include <cstring>
#define maxn 100010
int a[maxn];
int ma[maxn];
//int first[maxn];
int last[maxn];
using namespace std;

int main()
{
    int t;
    while(~scanf("%d", &t))
    {
        int flag = 0;
        int num = 1;
        int n;
        int qian,hou,big;
        while(t--)
        {
            scanf("%d", &n);
            for(int i = 0; i < n; i++)
            {
                scanf("%d", &a[i]);
            }
            big = -1005;
            int sum = 0;
            qian = 1;
            int temp = 1;
            for(int i = 0; i < n; i++)
            {
                sum += a[i];
                //第一步big存储为第一个元素
                if(sum > big)
                {
                    big = sum;
                    qian = temp;
                    hou = i + 1;
                }
                if(sum < 0)
                {
                    sum = 0;
                    temp = i + 2;
                }
            }
            if(flag)
                printf("\n");
            flag = 1;
            printf("Case %d:\n", num++);
            printf("%d %d %d\n", big, qian, hou);
        }
    }
    return 0;
}