Acwing_102最佳牛围栏 【思维型二分】

题目链接:最佳牛围栏

二分问题其实可以转化为判定问题
该问题的思路就是先假设存在这样一个平均值avg,然后用二分进行逐步判断
给定一个平均值avg，判断是否存在一个方案,使其平均值≥avg

AC代码:

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;

const int N = 100010;
int n, F;
double a[N], s[N];
bool check(double avg) {
	for (int i = 1; i <= n; i++) {//预处理前缀和
		s[i] = s[i - 1] + a[i] - avg;
	}
	double mins = 0;
	for (int k = F; k <= n; k++) {
		mins = min(mins, s[k - F]);
		if (s[k] >= mins) return true;
	}
	return false;
}


int main()
{
	scanf("%d%d", &n, &F);
	double l = 0, r = 0;
	for (int i = 1; i <= n; i++) {
		scanf("%lf", &a[i]);
		r = max(r, a[i]);
	}

	while (r - l > 1e-5) {
		double mid = (l + r) / 2;
		if (check(mid)) l = mid;
		else r = mid;
	}
	printf("%d\n", (int)(r * 1000));

	system("pause");
	return 0;
}