https://vjudge.net/contest/286336#problem/C
题意:从n个连续的数中选出大于等于k个连续的数,使得这k个数平均数最大,求这个平均数
题解:二分答案,因为要求平均数就会涉及到浮点数,为了避免精度误差,我们用原序列的值减去二分的答案x,再对这个序列的值求一个前缀和,那么这样我们只要求前缀和sum数组中是否存在长度大于等于k,且和大于0(因为减去了x,如果不减去x,那么就要判断原数组是否存在某一段长度大于等于k,且平均数大于x)的某一段。
代码
/* ***********************************************
Author :pall_scall
Created Time :2019年03月05日 星期二 21时35分26秒
File Name :vj.cpp
************************************************ */
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <string>
using namespace std;
typedef long long ll;
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mem(a,b) memset(a,b,sizeof(a))
#define lowbit(x) x&-x
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
const double eps = 1e-6;
const double pi = acos(-1.0);
int n,m;
double a[maxn],sum[maxn];
bool judge(double x){
int cnt = 0;
for(int i = 1; i <= n; i++){
sum[i] = sum[i-1] + a[i]-x;
}
double mi = 1e18,mx = -1e18;
for(int i = m; i <= n; i++){
mi = min(mi,sum[i-m]);
mx = max(mx,sum[i]-mi);
}
return mx >= 0;
}
int main(){
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
while(cin>>n>>m){
for(int i = 1; i <= n; i++){
scanf("%lf",&a[i]);
}
double l = 0, r = 2005;
while(r-l > eps){
double mid = (l+r)/2.0;
if(judge(mid)) l = mid;
else r = mid;
}
printf("%d\n",int(r*1000.0));
}
return 0;
}