难度:4
知识点:二分,单调队列
对这种题越来越熟悉了,二分答案,对于给定的平均值,判定是不是有满足题目条件的区间大于它,然后减去它,判定是不是有满足的区间和大于零,转化为前缀和序列上,求当前点左边定长区间的最小值,用单调队列正合适,边求边统计答案即可,
但是一开始第21行写成+=错了好久,简单想一下,因为这个函数要执行好多次,所以不能写成加等于号,每次都要重新赋值
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
const int N = 1e5 + 5;
const double eps = 1e-5;
int n, l, r;
double a[N], sum[N];
bool check(double x) {
for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i] - x;
double ans = -1e6;
deque<int> q; q.pb(0); ans = max(ans, sum[l] - sum[0]);
for (int i = l + 1; i <= n; i++) {
if (i - q.front() > r) q.pop_front();
while (!q.empty() && sum[i - l] <= sum[q.back()]) q.pop_back();
q.pb(i - l); ans = max(ans, sum[i] - sum[q.front()]);
}
return ans >= 0;
}
void solve(double l, double r) {
while (r - l > eps) {
double mid = (l + r) / 2;
if (check(mid)) l = mid;
else r = mid;
}
printf("%.3f", r);
}
int main() {
cin >> n >> l >> r;
for (int i = 1; i <= n; i++) cin >> a[i];
solve(-1e4, 1e4);
return 0;
}