二分

102. 最佳牛围栏

二分+动态规划+前缀和

求一个最大的子段和，子段的长度不小于L。我们可以枚举右端点，根据右端点枚举左端点

double ans = -1e10;
double min_val = 1e10;
for (int i = len; i <= n; i++){
	min_val = min(min_val, sum[i - len]);//最小的前缀和
	ans = max(ans, sum[i] - min_val);//最大的子序列和
}

每次计算出最大的子段和，判断一下最大子段和是不是非负数。

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 1e5 + 5;

double a[N], b[N], sum[N];//原序列，减去mid后的序列，前缀和序列

int main(void)
{
	int n, len;
	cin >> n >> len;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	double eps = 1e-5;
	double l = -1e6, r = 1e6;
	while(r - l > eps){
		double mid = (l + r) / 2;
		for (int i = 1; i <= n; i++){
			b[i] = a[i] - mid;
			sum[i] = sum[i - 1] + b[i];
		}
		double ans = -1e10;
		double min_val = 1e10;
		for (int i = len; i <= n; i++){
			min_val = min(min_val, sum[i - len]);//最小的前缀和
			ans = max(ans, sum[i] - min_val);//最大的子序列和
		}
		if(ans >= 0)
			l = mid;
		else
			r = mid;
	}
	cout << int(r * 1000) << endl;
	return 0;
}