ABC 236 E（二分+dp

E - Average and Median
思路：
经典的平均数和中位数处理方法
code：

#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(x) x.begin(), x.end()
#define mem(x, d) memset(x, d, sizeof(x))
#define eps 1e-6
using namespace std;
const int maxn = 1e5 + 9;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
ll n, m;
int a[maxn];
double f1[maxn][2];
int f2[maxn][2];

bool check1(double mid){
	f1[1][0] = 0, f1[1][1] = a[1] - mid;
	for(int i = 2; i <= n; ++i){
		double d = a[i] - mid;
		f1[i][0] = f1[i-1][1];
		f1[i][1] = max(f1[i-1][0], f1[i-1][1]) + d;
	}
	return max(f1[n][0], f1[n][1]) >= 0;
}
bool check2(int mid){
	f2[1][0] = 0, f2[1][1] = a[1] >= mid ? 1 : -1;
	for(int i = 2; i <= n; ++i){
		int d = a[i] >= mid ? 1 : -1;
		f2[i][0] = f2[i-1][1];
		f2[i][1] = max(f2[i-1][1], f2[i-1][0]) + d;
	}
	return max(f2[n][0], f2[n][1]) > 0;
}
void work()
{
	cin >> n;
	for(int i = 1; i <= n; ++i) cin >> a[i];
	double l = 0, r = 1e9;
	for(int i = 1; i <= 60; ++i){
		double mid = (l + r) / 2.0;
		if(check1(mid)) l = mid;
		else r = mid;
	}
	cout << fixed << setprecision(4) << l << endl;
	int dl = 0, dr = 1e9;
	while(dl < dr){
		int mid = (dl + dr + 1) >> 1;
		if(check2(mid)) dl = mid;
		else dr = mid - 1;
	}
	cout << dl;
}

int main()
{
	ios::sync_with_stdio(0);
//	int TT;cin>>TT;while(TT--)
	work();
	return 0;
}