HDOJ 1003 Max Sum(动态规划)
来源:互联网 发布:js浏览器定位 编辑:程序博客网 时间:2024/05/16 12:13
Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 176237 Accepted Submission(s): 41047
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
Author
Ignatius.L
Recommend
We have carefully selected several similar problems for you: 1176 1087 1069 2084 1058
#include<stdio.h>#include<string.h>int main(){int n,i,a[100001],t=1,m;int thissum,maxsum,star,end,mark;//目前的和,历史最大和,最大和开始点,最大和终止点,标记(为定开始点用)scanf("%d",&n);while(n--){memset(a,0,sizeof(a));//初始化scanf("%d",&m);for(i=0;i<m;i++){scanf("%d",&a[i]);}thissum=0; maxsum=a[0]; star=1; end=1; mark=1;//从第一个数开始for(i=0;i<m;i++){thissum+=a[i];//目前和要加上当前数 if(thissum>maxsum){maxsum=thissum;star=mark;//其实mark不变,开始位置就不变 end=i+1;//结束位置是当前 }//发现历史最大和比当前和小了,最大连续子序列不唯一,则输出序号i和j最小的那个 ,所以不 =if(thissum<0){ mark=i+2;//标记后一个数,为star做准备 thissum=0; //当前最大值清理 }//目前最大和小于0,就不是最大了,要是等于0或大于0还好说 }printf("Case %d:\n%d %d %d\n",t++,maxsum,star,end);if(n) printf("\n");//格式 }return 0;}
0 0
- HDOJ 1003 Max Sum(动态规划)
- HDOJ 1003 Max Sum(动态规划)
- HDOJ 1003 Max Sum(动态规划)
- hdoj 1003 Max Sum(动态规划)
- HDOJ 1003 Max Sum 动态规划入门(
- HDOJ 1003 Max Sum(新手动态规划)
- HDU 1003 Max Sum(动态规划)
- HDU-1003- Max Sum (动态规划)
- HDU 1003 Max Sum (动态规划)
- hdu 1003 Max Sum (动态规划)
- 杭电OJ(HDOJ)1003题:Max Sum(动态规划)
- Max Sum(动态规划)
- HDOJ 1024 Max Sum Plus Plus -- 动态规划
- hdoj 1024 Max Sum Plus Plus 【动态规划】
- hdoj problem 1024Max Sum Plus Plus(动态规划&&DP问题)
- HDOJ 题目1024 Max Sum Plus Plus(动态规划,不想交子段最大和)
- hdu 1003 (动态规划入门)Max Sum
- HDU:1003 Max Sum(动态规划DP)
- java处理json
- HTTP长连接与短连接
- mysql进阶(三)游标简易教程
- 斐波那契(递归的应用)
- ERROR 2002 (HY000): Can’t connect to local MySQL server through socket ‘/var mysql 启动不了
- HDOJ 1003 Max Sum(动态规划)
- BC430-Unit1:Introduction to the Dictionary
- 个人记录。
- HBase数据压缩方式的选择
- 小断大端问题
- Android 人脸特征点检测(主动形状模型) ASM Demo (Active Shape Model on Android)
- hdu 4741——Save Labman No.004
- android的消息处理机制(图+源码分析)——Looper,Handler,Message
- window.location.href后面的url带多个参数