【题解】poj2018 二分

题目链接

#include<cstdio>
#include<algorithm>
using namespace std;
#define _rep(i,a,b) for(int i=(a);i<=(b);i++)
const double eps=1e-6;
const int N=1e5+10;
int n,f;
double a[N],b[N],sum[N];
int main()
{
    //freopen("in.txt","r",stdin);
    scanf("%d%d",&n,&f);
    _rep(i,1,n)scanf("%lf",&a[i]);
    double l=-1e6,r=1e6;
    while(r-l>eps)//二分平均数 
    {
        double mid=(l+r)/2;
        _rep(i,1,n)b[i]=a[i]-mid;
        _rep(i,1,n)sum[i]=sum[i-1]+b[i];
        double ans=-1e10;
        double minn=1e10;
        _rep(i,f,n)minn=min(minn,sum[i-f]),ans=max(ans,sum[i]-minn);
        if(ans>=0)l=mid;else r=mid;
    }
    printf("%d\n",(int)(r*1000));
    return 0;
}