加载中…
个人资料
谢先斌
谢先斌
  • 博客等级:
  • 博客积分:0
  • 博客访问:391,554
  • 关注人气:201
  • 获赠金笔:0支
  • 赠出金笔:0支
  • 荣誉徽章:
相关博文
推荐博文
谁看过这篇博文
加载中…
正文 字体大小:

1003 Max Sum

(2012-09-20 21:59:48)
标签:

c

hdu1003

教育

谢先斌

分类: ACM/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

 

 

Author

Ignatius.L

 

 

6802937

2012-09-20 12:25:29

Accepted

1003

62MS

304K

501 B

C++

hixxb

      

       这是一个求最大子数列的题目,参考代码如下:

#include

using namespace std;

 

int main()

{

       int start, end, n, t, k, max, temp, i, j, a;

       cin>>t;

       k=t;

       while(k--)

       {

              max=-1002;

              start=end=0;

              temp=0;

              cin>>n;

              for(i=0, j=0; i

              {

                     cin>>a;

                     temp+=a;

                     if(temp>max)

                     {

                            max=temp;

                            start=j;

                            end=i;

                     }

                     if(temp<0)

                     {

                            temp=0;

                            j=i+1;

                     }

              }

              cout<<"Case "<<t-k<<":"<<endl;

              cout<<max<<" "<<start+1<<" "<<end+1<<endl;

              if(k!=0)

                     cout<<endl;

       }

       return 0;

}

0

阅读 评论 收藏 转载 喜欢 打印举报/Report
  • 评论加载中,请稍候...
发评论

    发评论

    以上网友发言只代表其个人观点,不代表新浪网的观点或立场。

      

    新浪BLOG意见反馈留言板 电话:4000520066 提示音后按1键(按当地市话标准计费) 欢迎批评指正

    新浪简介 | About Sina | 广告服务 | 联系我们 | 招聘信息 | 网站律师 | SINA English | 会员注册 | 产品答疑

    新浪公司 版权所有