Weakness and Poorness

Weakness and Poorness

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.
题意：给你一段序列，找这么一个x，使得让这段序列各个元素都减去x之后，和的绝对值最大的子序列在所有可能的x取值里是最小的。
最小里面找最大和最大里面找最小问题，一般采用二分法或三分法来做，可以想到的是，如果存在这么一个答案x0，那么比x0大或比x0小的x都会让最终的最大和的绝对值偏大，所以这是一个凹函数，需用三分法来解决。
本题需求出和的绝对值最大的子序列，而和可能是正数或负数，一种简单的思路就是求一遍最大的和，把数组全取负，再求一遍最大和，两个答案里大的就是绝对值最大的和。
AC代码：

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#include<string>
#include<algorithm>
#include<map>
#include<sstream>
#include<set>
#define debug(x) cout << "[" << #x <<": " << (x) <<"]"<< endl
#define CLE(a,b) memset(a,b,sizeof(a))
#define MEC(a,b) memcpy(a,b,sizeof(a))
#define ll long long
#define inff 0x7fffffff
using namespace std;
const int MAXN = 2e6;
int n;
double a[MAXN];
double b[MAXN];
double find_max(double* c)//找和的绝对值最大函数
{
	double ans=0, temp = 0;
	for (int i = 0;i < n;i++)
	{
		temp += c[i];
		if (temp < 0) temp = 0;
		ans = max(ans, temp);
	}
	return ans;
}
double f(double* a, double x)	
{
	for (int i = 0;i < n;i++)
	{
		b[i] = a[i] - x;
	}
	double max1 = find_max(b);
	for (int i = 0;i < n;i++)
	{
		b[i] = -b[i];
	}
	double max2 = find_max(b);
	double max0 = max(max1, max2);
	return max0;
}
double search()		//三分函数
{
	double l, r, lm, rm;
	l = -1e4, r = 1e4;
	while (r - l > 2e-12)
	{
		lm = l + (r - l) / 3;
		rm = r - (r - l) / 3;
		if (f(a,lm) < f(a,rm))
			r = rm;
		else
			l = lm;
	}
	return f(a, rm);
}
int main()
{
	cin >> n;
	for (int i = 0;i < n;i++)
		cin >> a[i];
	double ans;
	ans=search();
	printf("%.15f", ans);
	return 0;
}