1003 Max Sum
来源:互联网 发布:4g网络加速代码 编辑:程序博客网 时间:2024/06/14 09:21
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
25 6 -1 5 4 -77 0 6 -1 1 -6 7 -5
Sample Output
Case 1:14 1 4Case 2:7 1 6#include <stdio.h>int main(){ int T,N,i,cas=1, a[100010]; int start,end,temp,sum,max=0; scanf("%d",&T); while(T--){ scanf("%d",&N); start=end=temp=1; sum=0; max=-1001; for(i=1;i<=N;i++){ scanf("%d",&a[i]); sum+=a[i]; if(sum>max){ max=sum; start=temp; end=i; } if(sum<0){ sum=0; temp=i+1; } } printf("Case %d:\n",cas++); printf("%d %d %d\n",max,start,end); if(T>0) printf("\n"); } return 0;}
阅读全文
0 0
- 1003 Max Sum
- HDOJ 1003 Max Sum
- HDU 1003 Max Sum
- HDOJ 1003 Max Sum
- 1003:max sum
- hdoj 1003 Max Sum
- hdu 1003 Max Sum
- hdu 1003 Max Sum
- HDOJ 1003 Max Sum
- HDU-1003 max sum
- hdoj 1003Max Sum
- 1003 Max Sum
- HDU 1003 - Max Sum
- HDU 1003 Max Sum
- 1003 Max Sum
- hdu 1003 Max Sum
- HDU 1003 Max Sum
- HDU 1003 Max Sum
- 查看oracle数据库的数据文件的目录
- 使用命令行工具,如何创建nicelooking DMG的Mac OS X?
- AJax 把拿到的后台数据在页面中渲染
- 【Maven+SSM】如何通过Mybatis写一个中文查询请求及所遇到的问题
- virtualbox虚拟机ubuntu,安装docker,配置javaweb环境,简单实现负载均衡
- 1003 Max Sum
- 性能测试报告
- 在Vim,整行上下移动
- ubuntu 安装google并且配置海豚vpn
- 为什么技术与产品沟通起来总是那么痛苦
- centos7安装MongoDB3.4
- Qt jpg图片显示
- 【JZOJ 5445】【NOIP2017提高A组冲刺11.2】失格
- mysql 性能优化