点击打开链接

Max Sum

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 255311 Accepted Submission(s): 60666

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

#include<iostream>
using namespace std;
int main()
{int N,n,a,first,last;cin>>N;for(int i=1;i<=N;i++){cin>>n;int max=-1000,sum=0,k=1;for(int j=1;j<=n;j++){cin>>a;sum=sum+a;if(sum>max)//如果当前的最大值大于以前的最大值  更新 sum 与max 都是一种计算的结果和属性相同{first=k;last=j;max=sum;}if(sum<0)//else{k=j+1;sum=0;}}cout<<"Case "<<i<<":"<<endl;cout<<max<<" "<<first<<" "<<last;if(i==N)cout<<endl;elsecout<<endl<<endl;}return 0;
}

#include <stdio.h>
int main()
{int z,n,max,sum;int a,b,A,B,t;scanf("%d",&z);for(int k=1;k<=z;k++){scanf("%d",&n);sum = max = -1001;for(int i=1;i<=n;i++){scanf("%d",&t);if(sum+t < t)sum = t , a = b = i;      //a、b记录当前连续子序列的起始、结束位置elsesum += t , ++b;if(max < sum)//附一篇另一种代码，max = sum , A = a , B = b;}printf("Case %d:\n%d %d %d\n",k,max,A,B);if(k-z) puts("");}return 0;
}

HDU_1003 Max Sum相关推荐

HDU 1024：Max Sum Plus Plus（DP）
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): ...
整数行hdu 1244 Max Sum Plus Plus Plus(dp)
废话就不多说了,开始... Max Sum Plus Plus Plus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/3 ...
hdu 1003 Max Sum 解题报告
链接:http://acm.hdu.edu.cn/showproblem.php?pid=1003 Problem Description Given a sequence a[1],a[2],a[3 ...
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 ...
J - Max Sum
题目链接:http://acm.hust.edu.cn/vjudge/contest/126708#problem/J 题目大意:求最大的和,并输出初末位置解题思路:两重for循环,第一重的意思是把 ...
HD 1003 Max Sum (最大字段和问题)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1003 Problem Description Given a sequence a[1],a[2],a ...
HD 1003 Max Sum(贪心)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1003 Problem Description Given a sequence a[1],a[2],a ...
[云炬python学习笔记]Numpy中内置函数min(),max(),sum()与Python中内置函数min(),max(),sum()性能对比分析
众所周知,Python有许多内置函数(例如min(),max(),sum()),Numpy也有自己的内置函数(np.min(),np.max(),np.sum()).由于Numpy的函数是在编译码中执 ...
杭电60题--part 1 HDU1003 Max Sum（DP 动态规划）
最近想学DP,锻炼思维,记录一下自己踩到的坑,来写一波详细的结题报告,持续更新. 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1003 Problem ...

HDU_1003 Max Sum

点击打开链接

Max Sum

HDU_1003 Max Sum相关推荐

最新文章

热门文章