PAT1007. Maximum Subsequence Sum
来源:互联网 发布:bcg矩阵分析法 编辑:程序博客网 时间:2024/05/16 00:47
#include<climits>#include<iostream>using namespace std;int sum[10004],val[10004];int main(){ int cnt;cin>>cnt; for(int i=0;i<cnt;++i){ cin>>val[i]; sum[i]+=(i?sum[i-1]+val[i]:val[i]); } int mmax=INT_MIN,_i,_j; for(int i=0;i<cnt;++i) for(int j=i;j<cnt;++j){ int tmp=sum[j]-sum[i]+val[i]; if(tmp>mmax)mmax=tmp,_i=i,_j=j; } if(mmax<0)cout<<0<<' '<<val[0]<<' '<<val[cnt-1]; else cout<<mmax<<' '<<val[_i]<<' '<<val[_j]; }做下预处理就能在线性时间内求出序列中任意区间内数字之和
0 0
- PAT1007. Maximum Subsequence Sum
- PAT1007. Maximum Subsequence Sum
- pat1007 Maximum Subsequence Sum
- PAT1007. Maximum Subsequence Sum (25)
- PAT1007 Maximum Subsequence Sum (25)
- PAT1007. Maximum Subsequence Sum (25)
- PAT1007. Maximum Subsequence Sum (25)
- 【DP-最大子串和】PAT1007. Maximum Subsequence Sum
- Maximum Subsequence Sum[PAT1007][PTA01-复杂度2]——动态规划
- PAT1007:Maximun Subsequence Sum Java语言实现
- Maximum Subsequence Sum
- 1007. Maximum Subsequence Sum
- PAT_1007: Maximum Subsequence Sum
- 1007 Maximum Subsequence Sum
- PAT - Maximum Subsequence Sum
- Maximum Subsequence Sum (25)
- Maximum Subsequence Sum
- 1007.Maximum Subsequence Sum
- extjs tree 的正确的后台数据(亲测)
- 青春,如盛开的玫瑰
- PAT1008. Elevator
- Search Insert Position--寻找插入点Given a sorted array and a target value, return the index if the target
- Could not open ServletContext resource [/WEB-INF/applicationContext.xml]
- PAT1007. Maximum Subsequence Sum
- 澳大利亚的父母喜欢女孩,如果生出来的第一个是女孩,就不再生了,如果是男孩就继续生,直到生到第一个女孩为止,问若干年后,男女的比例是多少?
- csf格式转化为wmv
- 通过live555实现H264 RTSP直播
- 使用联合类型
- 按键精灵--------后台插件
- MacBook Pro 下Bash Shell 利用Alias 简化命令
- 开始学习opengl,整理一下vs2010配置opengl的方法(WIN7 64位)
- HDU 1050 Moving Tables 贪心