Max Sum（最大子序列和）（经典dp）

最新推荐文章于 2024-10-01 22:13:15 发布

原创最新推荐文章于 2024-10-01 22:13:15 发布 · 3k 阅读

5 ·

本内容遵循CC 4.0 BY-SA版权协议

杭电刷题专栏收录该内容

26 篇文章

订阅专栏

本文介绍了一种求解整数序列中最大和子序列的算法，并提供了完整的C语言实现代码。通过对输入序列进行逐个元素扫描，算法能够高效地找到具有最大和的连续子序列及其起始和结束位置。

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<stdio.h>
int main()
{
    int n,m,i,j,end,begin,temp,max;
    int e,f,k,flag=1;
    int a[100005];
    scanf("%d",&n);
    k=1;
    while(n--)
    {
        begin=end=0;

        scanf("%d",&m);
        for(i=1;i<=m;i++)
        {
            scanf("%d",&a[i]);
        }
        temp=0;
        max=-999999;
        begin=e=1;
        f=1;

        for(i=1;i<=m;i++)
        {
            temp+=a[i];

            if(temp>max)
            {
                e=begin;
                f=i;
                max=temp;
            }

            if(temp<0)
            {
                begin=i+1;
                temp=0;
            }

        }
        printf("Case %d:\n",k++);
        printf("%d %d %d\n",max,e,f);
        if(n!=0)
            printf("\n");
    }
    return 0;
}