Codeforces Round #320 (Div. 2) [Bayan Thanks-Round]
2016-04-19 17:31
393 查看
E. Weakness and Poorness
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given a sequence of n integers a1, a2, ..., an.
Determine a real number x such that the weakness of the sequence a1 - x, a2 - x, ..., an - x is
as small as possible.
The weakness of a sequence is defined as the maximum value of the poorness over all segments (contiguous subsequences) of a sequence.
The poorness of a segment is defined as the absolute value of sum of the elements of segment.
Input
The first line contains one integer n (1 ≤ n ≤ 200 000),
the length of a sequence.
The second line contains n integers a1, a2, ..., an (|ai| ≤ 10 000).
Output
Output a real number denoting the minimum possible weakness of a1 - x, a2 - x, ..., an - x.
Your answer will be considered correct if its relative or absolute error doesn't exceed 10 - 6.
Examples
input
output
input
output
input
output
Note
For the first case, the optimal value of x is 2 so
the sequence becomes - 1, 0, 1 and
the max poorness occurs at the segment "-1" or segment "1". The poorness value (answer) equals to 1 in this case.
For the second sample the optimal value of x is 2.5 so
the sequence becomes - 1.5, - 0.5, 0.5, 1.5 and the max poorness occurs on segment "-1.5 -0.5" or "0.5 1.5". The poorness value (answer) equals
to 2 in this case.
三分查找:如果遇到凸性或凹形函数时,可以用三分查找求那个凸点或凹点。
ternary search
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given a sequence of n integers a1, a2, ..., an.
Determine a real number x such that the weakness of the sequence a1 - x, a2 - x, ..., an - x is
as small as possible.
The weakness of a sequence is defined as the maximum value of the poorness over all segments (contiguous subsequences) of a sequence.
The poorness of a segment is defined as the absolute value of sum of the elements of segment.
Input
The first line contains one integer n (1 ≤ n ≤ 200 000),
the length of a sequence.
The second line contains n integers a1, a2, ..., an (|ai| ≤ 10 000).
Output
Output a real number denoting the minimum possible weakness of a1 - x, a2 - x, ..., an - x.
Your answer will be considered correct if its relative or absolute error doesn't exceed 10 - 6.
Examples
input
3 1 2 3
output
1.000000000000000
input
4 1 2 3 4
output
2.000000000000000
input
10 1 10 2 9 3 8 4 7 5 6
output
4.500000000000000
Note
For the first case, the optimal value of x is 2 so
the sequence becomes - 1, 0, 1 and
the max poorness occurs at the segment "-1" or segment "1". The poorness value (answer) equals to 1 in this case.
For the second sample the optimal value of x is 2.5 so
the sequence becomes - 1.5, - 0.5, 0.5, 1.5 and the max poorness occurs on segment "-1.5 -0.5" or "0.5 1.5". The poorness value (answer) equals
to 2 in this case.
三分查找:如果遇到凸性或凹形函数时,可以用三分查找求那个凸点或凹点。
#include<bits/stdc++.h> using namespace std; #define rep(i,a,n) for(int i=a;i<n;++i) #define per(i,a,n) for(int i=n-1;i>=a;--i) #define mem(a,t) memset(a,t,sizeof(a)) #define pb push_back #define mp make_pair #define sz(a) (int)a.size() #define fi first #define se second typedef long long LL; #define N 200005 int a ; int n; const double eps=1e-12; double fun(double x) { double tmp=0,ans=0,tmin=0,tmax=0; rep(i,0,n){ tmp+=(a[i]-x); ans=max(ans,fabs(tmp-tmin)); ans=max(ans,fabs(tmp-tmax)); tmin=min(tmin,tmp); tmax=max(tmax,tmp); } return ans; } int main() { //freopen("in.txt","r",stdin); double l,r; scanf("%d",&n); l=1e7; r=-1e7; rep(i,0,n){ scanf("%d",&a[i]); l=min(l,1.*a[i]); r=max(r,1.*a[i]); } double f1,f2,mid1,mid2; rep(i,0,500){ mid1=l+(r-l)/3; mid2=r-(r-l)/3; f1=fun(mid1); f2=fun(mid2); if(f1<f2) r=mid2; else l=mid1; } cout.precision(10); cout<<fixed<<fun(l)<<endl; return 0; }
ternary search
相关文章推荐
- 1-6-04:数组逆序重放
- 介绍HTTPS
- 微信服务商支付流程----(帮助大家,跳过深坑!!)
- JS中的call()和apply()方法
- VS 开发工具中的Remote Debug 功能远程调试程序经验分享
- 音频后台播放
- 深入理解java虚拟机(一)--自动内存管理机制
- ArrayList(二): Android编程之ArrayList源码详解及使用
- Spark快速入门指南 – Spark安装与基础使用
- 服务器请求返回 500错误
- cocos2d 使用 C++开发游戏 出现#include "CardSprite.h" 无法引入源文件的情况。
- Python 编程小备忘
- 怎样使用ZOL一键安装器下载中关村在线的源安装包
- 关于js封装框架类库之属性操作
- Oracle中Hint深入理解
- Win2003下配置iis+php+mysql+zend
- 深入理解JVM(四)——对象内存的分配策略
- R语言︱分布函数与概率密度+随机数产生
- JSON基础以及JSON字符串转换为JSON对象
- Codeforces--333C--The Two Routes(最短路弗洛伊德)(思维)