HDOJ1003.Max Sum
2015-09-14 15:17
288 查看
试题请参见: http://acm.hdu.edu.cn/showproblem.php?pid=1003
, 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.
题目概述
Given a sequence a[1],a[2],a[3]……a, 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.
解题思路
最大子序列问题. 存在O(n)的解法.遇到的问题
对于子序列(-100, -10, -1000)始终无法获得正确结果.
源代码
#include <iostream> const int MAX_SIZE = 100000; int arr[MAX_SIZE]; int main() { int t = 0; std::cin >> t; for ( int i = 1; i <= t; ++ i ) { int n = 0; std::cin >> n; for ( int j = 0; j < n; ++ j ) { std::cin >> arr[j]; } int startIndex = 0, currentStartIndex = 0, endIndex = 0; int maxSum = -2147483648, currentSum = 0; for ( int j = 0; j < n; ++ j ) { currentSum += arr[j]; if ( currentSum > maxSum ) { startIndex = currentStartIndex; endIndex = j; maxSum = currentSum; } if ( currentSum < 0 ) { currentStartIndex = j + 1; currentSum = 0; } } std::cout << "Case " << i << ":" << std::endl; std::cout << maxSum << " " << startIndex + 1 << " " << endIndex + 1 << std::endl; if ( i != t ) { std::cout << std::endl; } } return 0; }
相关文章推荐
- cocos2d-x 集成社交分享平台shareSDK
- java.lang.NoClassDefFoundError: org/apache/log4j/Layout
- 装饰图案 C#
- 前端性能优化的总结
- 用yum查询想安装的软件
- 通过Socket实现UDP(用户数据报)编程
- c# lua 简单交互
- C语言字符串反转实现【采用头指针和尾指针方法完成】
- excel2003 操作
- android中svg文件的使用
- 产品管理?企业规范化?iclap秀出新高度
- ActionBar SearchView空指针异常
- 栈的基本操作-数据结构
- jerbrains产品算号
- Android第四十九期 - 仿QQ空间上传功能+本地数据库存储
- java序列化/反序列化之xml、protobuf、protostuff 的比较与使用例子
- 探索性数据分析与可视化
- 51单片机在Keil中使用printf进行串口输出
- aop概念
- Leetcode56: Invert Binary Tree