hdoj1003

翻译 2012年03月28日 20:51:22

Max Sum

                                                                        Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

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>
#define M 100003

int T;

int N;

int start;
int end;

int stmp;

int tmp;

int max;

int number[M];

int main(void) {
    int c=0;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&N);
        for(int i=1;i<=N;i++)
            scanf("%d",&number[i]);
        max=-1000000000;
        start=1;
        end=1;
        stmp=1;
        tmp=0;
        for(int i=1;i<=N;i++){
            tmp+=number[i];
            if(tmp>max){
                start=stmp;
                end=i;
                max=tmp;
            }
            if(tmp<0){
                stmp=i+1;
                tmp=0;
            }
        }
        printf("Case %d:\n",++c);
        printf("%d %d %d\n",max,start,end);
        if(T)
            printf("\n");
    }

    return 0;
}


HDOJ1003

  • 2007年07月26日 15:56
  • 1KB
  • 下载

HDOJ 1003:最大子序列|最大子串|最大连续和

暴力O(n^2),听说正解是n的复杂度。10w的n平方复杂度就轻松过1000ms了。 #include #include using namespace std; int main() {...

hdoj 1003 最大子序列 (考虑负数)On算法

1003题目 Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate ...

HDOJ 1003

Max SumTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Subm...

HDOJ1003

Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum...

[hdoj]1003最大子列和

Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Su...
  • vinater
  • vinater
  • 2015年08月01日 14:56
  • 343

HDOJ--1003Max Sum

典型的求最大子数组和的问题,在前面的一篇文章中已经讨论过这个算法了.STL标准库为我们提供了一个更好操作的模版---vector, 相比数组, vector具有可动态增长的特点,不像数组一旦定义,空间...

hdoj1003 Max Sum (DP 最大子序列求和)

题目:http://acm.hdu.edu.cn/showproblem.php?pid=1003 题意:         做T次测试,每次测试输入N个数据a1,a2,a3...an。要求出这个数字序...

HDOJ 1003 ( Max Sum )

DP

HDOJ1003(最大连续子串)

Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdoj1003
举报原因:
原因补充:

(最多只允许输入30个字)