hdu 1003 Max Sum 解题报告

链接：http://acm.hdu.edu.cn/showproblem.php?pid=1003

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

简单的动态规划，最大子串和；

/********* hdu 1003 ************/
/********* 琴心&剑胆 ************/
/********* 2011/5/9 ************/

#include<stdio.h>
int main(){
int T;
scanf( "%d",&T );
int M=T;
while( T-- ){
int n;
scanf( "%d",&n );
int a[n],ts=0,ti=0,s=0,bi=0,bj=n-1,f=0,max=-32767,mi;
for( int i=0;i<n;++i ){
scanf( "%d",&a[i] );
if(max<a[i]){
max=a[i];
mi=i;
}
if( a[i]<0 )
f++;
ts+=a[i];
if(ts<0){
ts=0;
ti=i+1;
}
if(s<ts){
s=ts;
bj=i;
bi=ti;
}
}
printf("Case %d:\n",M-T);
if( f==n )
printf( "%d %d %d\n",max,mi+1,mi+1 );
else
printf( "%d %d %d\n",s,bi+1,bj+1 );
if( T )
printf("\n");
}
}

转载于:https://www.cnblogs.com/jian1573/archive/2011/05/09/2041504.html

hdu 1003 Max Sum 解题报告相关推荐

HDU.1003 Max Sum
原题 HDU.1003 Max Sum 分类动态规划题意计算从一个序列中最大连续子序列和.对应的起始元素和终止元素的位置. 输入/输出要求与格式样例数的确定最开始一行开始输入样例数每个样 ...
hdu 1003 Max Sum (DP)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1003 Max Sum Time Limit: 2000/1000 MS (Java/Others) ...
[hdu 1003] Max Sum
跟<算法导论(第三版)>上的一样,抄下来的 30 - 60 ms 标准的分治策略 1 #include <stdio.h> 2 3 int A[100000], Lenght; ...
hdu 1003 Max Sum
DP可以这里给出非DP程序题目传送门 1 #include<stdio.h> 2 int main() 3 { 4 int t,n,i,max,m,sum,ki,kj,k,a,b; 5 ...
HDU 1003——Max Sum（动态规划）
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1003 题目大意:历遍所有数字,找出最大字段和. 解题思路: t和n:记录循环次数和每一段有多少个数字 ...
位置子段最大子段和 hdu 1003 max sum ACM的开始
每日一贴,今天的内容关键字为位置子段这个标题的印象是较比刻深的,我的第一个动态规划标题,也是ACM的开始.最大字段和是较比经典的动归问题.求一个列序的最大子段和的关键点就在于断判一个元素的归属问题, ...
杭电OJ——ACM 1003.Max Sum
Max Sum 杭电OJ--ACM 1003.Max Sum链接入口问题描述大意: 给定一个序列a[1],a[2],a[3]-a[n],你需要算出其子序列中的最大值.比如说:给你一个 ...
HDU 1244 Max Sum Plus Plus Plus
虽然这道题看起来和 HDU 1024 Max Sum Plus Plus 看起来很像,可是感觉这道题比1024要简单一些前面WA了几次,因为我开始把dp[22][maxn]写成dp[maxn][2 ...
HD 1003 Max Sum (最大字段和问题)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1003 Problem Description Given a sequence a[1],a[2],a ...

hdu 1003 Max Sum 解题报告

hdu 1003 Max Sum 解题报告相关推荐

最新文章

热门文章