hdu Max Sum
来源:互联网 发布:温州网络问政 排名 编辑:程序博客网 时间:2024/05/17 22:20
Max Sum
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>#include<string.h>#define max(a,b) (a>b?a:b)#define min(a,b) (a<b?a:b)#define N 100000+10int a[N];int main(){ int t,m=0; scanf("%d",&t); while(++m<=t) { int n,i,j; scanf("%d",&n); for(i=1; i<=n; i++) scanf("%d",&a[i]); int maxn=-10000,x1=1,cnt=0,x,y; for(i=1; i<=n; i++) { cnt+=a[i]; if(cnt>maxn) x=x1,y=i,maxn=cnt; if(cnt<0) cnt=0,x1=i+1; } printf("Case %d:\n%d %d %d\n",m,maxn,x,y); if(m!=t) printf("\n"); } return 0;}ps:我还以为 5 1 0 0 0 0 这组数据的答案是1 1 5呢,WA了n次,也没谁了
1 0
- HDU 1003 Max Sum
- hdu 1003 Max Sum
- hdu 1003 Max Sum
- HDU-1003 max sum
- HDU 1003 - Max Sum
- HDU 1003 Max Sum
- hdu 1003 Max Sum
- HDU 1003 Max Sum
- HDU 1003 Max Sum
- hdu 1003 max sum
- HDU 1003 Max Sum
- hdu 1003.Max Sum
- hdu 1003 Max Sum
- HDU 1003 Max Sum
- hdu 1003 Max Sum
- HDU 1003 Max Sum
- Hdu 1003 - Max Sum
- HDU-1003-Max Sum
- linux-利用iconv批量转换GBK文件到UTF-8编码方法
- Unity surface shader 2
- 线上提供个视频地址,用java 轻松抓取到本地
- VirtualBox 修改不了Host-only网络的ip地址
- jquery常用技巧
- hdu Max Sum
- JavaWeb HttpServletRequest&HttpServletResponse小记
- ubuntu搭建Gerrit代码审核服务器
- 音频处理——pcm基础知识与重采样
- 关于短延迟 sleep usleep nanosleep select
- HBase入门-安装
- Android Context完全解析,关于Context那点事
- //解决SwipeRefreshLayout和RecyclerView存在滑动冲突的问题
- Ext.Net MVC 配置(1)