ayit 第九周周赛 h题

最新推荐文章于 2020-06-10 22:06:15 发布

hdy403

最新推荐文章于 2020-06-10 22:06:15 发布

阅读量101

点赞数

本文链接：https://blog.csdn.net/m0_46628834/article/details/105621246

版权

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<stdio.h>
int main()
{
    int r,k=0;
    scanf("%d",&r);
    while(r--)
    {
        int l,x,a=1,b=1,c,n=1,m,i;
        scanf("%d%d",&m,&x);
        l=x,k++;
        for(i=2; i<=m; i++)
        {
            if(l<0)
            {
                n=i;
                l=0;
            }
            scanf("%d",&c);
            l=l+c;
            if(l>x)
            {
                x=l;
                a=i;
                b=n;
            }
        }
        printf("Case %d:\n",k);
        printf("%d %d %d\n",x,b,a);
        if(r>0)
            printf("\n");
    }
    return 0;
}

题型求最大连续子区间

题意给你几个数求出最大的数和并输出从几到几（坐标）

思路将当前子段的和与当前输入的数作比较，使子段和等于两者之间最大的数，当子段的和小于等于当前输入的数时，记录新的起点，并当新的最大子段和出现时，使用该新的起点

这种题不能排序，排序就错了记得第一做时就想到了排序结果不对