POJ2479——Maximum sum
来源:互联网 发布:mysql 指定数据库 编辑:程序博客网 时间:2024/05/16 08:48
Maximum sum
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 33107 Accepted: 10238
Description
Given a set of n integers: A={a1, a2,..., an}, we define a function d(A) as below:
Your task is to calculate d(A).
Input
The input consists of T(<=30) test cases. The number of test cases (T) is given in the first line of the input.
Each test case contains two lines. The first line is an integer n(2<=n<=50000). The second line contains n integers: a1, a2, ..., an. (|ai| <= 10000).There is an empty line after each case.
Each test case contains two lines. The first line is an integer n(2<=n<=50000). The second line contains n integers: a1, a2, ..., an. (|ai| <= 10000).There is an empty line after each case.
Output
Print exactly one line for each test case. The line should contain the integer d(A).
Sample Input
1101 -1 2 2 3 -3 4 -4 5 -5
Sample Output
13
Hint
In the sample, we choose {2,2,3,-3,4} and {5}, then we can get the answer.
Huge input,scanf is recommended.
Huge input,scanf is recommended.
Source
POJ Contest,Author:Mathematica@ZSU
分析:简单DP。
对每个i来说,求出[0~i-1]的最大子段和 以及 [i~n-1]的最大子段和,加起来,之后遍历i寻找到最大的和即为答案。
[0~i-1]的最大子段和从左向右,[i~n-1]的最大子段和从右向左。
时间复杂度O(n)。
//Maximum sum//cstdio是将stdio.h的内容用C++头文件的形式表示出来#include<cstdio>#include<algorithm>using namespace std;int a[50001];int left[50001];int right[50001];int main(){int ncase;scanf("%d",&ncase);while(ncase--){int n;scanf("%d",&n);for(int i=0;i<n;i++)scanf("%d",&a[i]);//此时left[i]为包含i最大子段和left[0] = a[0]; // !!!for(int i=1;i<n;i++){if(left[i-1] < 0)left[i] = a[i];elseleft[i] = left[i-1] + a[i];}//此时left[i]为i左边最大子段和for(int i=1;i<n;i++)left[i] = max(left[i], left[i-1]);//right[n-1] = a[n-1];for(int i=n-2;i>=0;i--){if(right[i+1] < 0)right[i] = a[i];elseright[i] = right[i+1] + a[i];}for(int i=n-2;i>=0;i--)right[i] = max(right[i], right[i+1]);//int ans = -10000;for(int i=1;i<n;i++)ans = max(ans, left[i-1]+right[i]);printf("%d\n",ans);}return 0;}
0 0
- POJ2479——Maximum sum
- poj2479——Maximum sum(dp)
- POJ2479 Maximum sum
- POJ2479 Maximum sum
- poj2479 - Maximum sum
- POJ2479 Maximum sum DP
- poj2479 Maximum sum
- poj2479 Maximum sum
- poj2479 Maximum sum
- POJ2479 Maximum sum
- poj2479 c++ : Maximum sum
- Poj2479-Maximum sum
- POJ2479&OpenJudge1481 Maximum sum
- POJ2479:Maximum sum
- poj2479——Maxnum sum
- Poj2593 VS Poj2479 Maximum sum
- POJ2479 Maximum sum 线性dp
- 【POJ2479】Maximum sum(动态规划,DP)
- wifi智能营销 wifi广告路由器
- 给JSP网站添加登录时的验证码
- (书稿底稿)(C/C++)第一章:CPU基础知识 1.1CPU和程序的执行
- 转转:解决Error"基础连接已经关闭: 未能为SSL/TLS 安全通道建立信任关系。"
- 【组队赛三】-C cf448B
- POJ2479——Maximum sum
- 回文数
- 《Linux》天影linux系列笔记一——linux常用命令详解:less
- Xcode的View关联问题
- 音视频处理框架
- c语言之————有头循环双链表实现栈存储
- zz 上海交大ACM队长建议——谈谈ACM比赛中的代码能力
- JComboBox自定义滚动条和去掉默认背景
- C++使用libcurl做HttpClient