码迷,mamicode.com
首页 > 其他好文 > 详细

Max Sum

时间:2015-05-12 15:18:08      阅读:89      评论:0      收藏: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
 

 

Author
Ignatius.L
 
 
#include<cstdio>
#include<iostream>
using namespace std;

int sum , start , en;
int T, n ;
int cur =1;
int temp , tempstart , tempmax , i ;
int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
#endif
    scanf("%d" , &T);
    while ( T-- )
    {
        scanf("%d",&n);
        scanf("%d",&temp);
        tempstart = 1;
        tempmax = temp;
        sum = temp;
        start = en = 1;
        for( i = 1 ; i < n ; i++ )
        {
            scanf("%d", &temp);
            if( tempmax + temp >= temp )
            {
                tempmax = tempmax + temp;
            }
            else
            {
                tempmax = temp;
                tempstart = i+1;
            }
            if( tempmax > sum )
            {
                sum = tempmax;
                start = tempstart;
                en = i + 1;
            }
        }
        printf("Case %d:\n",cur++);
        printf("%d %d %d\n",sum , start , en );
        if( T != 0 )
            printf("\n");
    }
    return 0;
}

 

Max Sum

标签:

原文地址:http://www.cnblogs.com/zhping/p/4497275.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!