hdoj1003-Max Sum(数组的最大和)
来源:互联网 发布:上海首届网络文化节 编辑:程序博客网 时间:2024/06/04 01:36
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
题目的大致意思就是求有最大和的子序列,我的方法是边读取数据边处理,当和出现为负值是记录当前点的前一个为右端点,当和大于最大值是更新左右端点; 特别要注意的是数据可能全为负,因此max的值应初始化为-1005。
#include <iostream>#include <fstream>using namespace std;int main(){ //ifstream cin("data.in"); int t; cin >> t; int count = 1; while(t --) { int n; cin >> n; int l = 0, l1 = 0, r = 0, sum = 0, r1 = 0, max = -1005; //数组有可能全为负,max初始值为-1005 for(int i = 0; i < n; i ++) { int temp; cin >> temp; sum += temp; if(sum > max) { //出现最大值时更新右端点 l = l1; r1 = i; max = sum; } else if(sum < 0) { //当当前和为负数时,更新左端点 sum = 0; l1 = i + 1; } } if(count > 1) { cout << endl; } cout << "Case " << count++ << ":" << endl; cout << max << " " << l+1 << " " << r1+1 << endl; } return 0;}
- hdoj1003-Max Sum(数组的最大和)
- HDOJ1003 Max Sum
- HDOJ1003:Max Sum
- HDOJ1003 Max Sum
- HDOJ1003.Max Sum
- HDOJ1003 Max Sum(脑洞)
- hdoj1003 Max Sum
- <hdoj1003>Max Sum
- Max Sum(hdoj1003)
- hdoj1003 Max Sum (DP 最大子序列求和)
- 数组最大连续和 max sum
- HDOJ1003 最大子数组
- hdu 1003 Max Sum【一维数组最大连续和】
- HDOJ1003(连续最大和)
- Max Sum(简单的最大子序列和的问题)
- HDU 1003 Max Sum 最大连续子序列的和
- HDU 1003 Max Sum (最大子序列的和)
- Max Sum 最大连续和的子序列
- java OutOfMemoryError
- 7.13 KUVA 401Palindromes
- 用python开发了一个简单apache web服务端范例,在win10 + apache2.4.9 + python3.5 测试成功
- spark sql读取mysql数据源并且将结果写入mysql
- 周三--项目2 【建设“顺序表” 算法库】
- hdoj1003-Max Sum(数组的最大和)
- CentOS6.5安装apr优化tomcat7性能
- 洛谷 P1144 最短路计数
- 你不知道的JavaScript笔记之关于this
- Qt之QUrlQuery
- 堆排序
- 数组名与数组指针
- python中常见的字符串处理函数
- 算法学习(1)