传送门
题目描述
给定一个长度为n的非负整数序列A,求一个平均数最大的,长度不小于L的子段。
分析
改改就是单调队列DP的板子题了
我们去二分最后答案,然后给数组内每一个数字都减去
m
i
d
mid
mid,最后预处理一下前缀和,如果存在一个长度大于等于
l
l
l的区间的和大于等于0,那么返回
t
r
u
e
true
true,否则返回
f
a
l
s
e
false
false
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod= 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a){char c=getchar();T x=0,f=1;while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){x=(x<<1)+(x<<3)+c-'0';c=getchar();}a=f*x;}
int gcd(int a,int b){return (b>0)?gcd(b,a%b):a;}
double a[N],sum[N];
int n,l;
bool check(double mid){
for(int i = 1;i <= n;i++) sum[i] = a[i] - mid;
for(int i = 1;i <= n;i++) sum[i] += sum[i - 1];
double minv = 1e10,ans = -1e10;
for(int i = l;i <= n;i++){
minv = min(minv,sum[i - l]);
ans = max(ans,sum[i] - minv);
}
if(ans >= 0) return true;
return false;
}
int main(){
read(n),read(l);
for(int i = 1;i <= n;i++) scanf("%lf",&a[i]);
double l = 0,r = 2000;
while(r - l > eps){
double mid = (l + r) / 2;
if(check(mid)) l = mid;
else r = mid;
}
int ans = r * 1000;
printf("%d\n",ans);
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/