102. 最佳牛围栏

Posted 2021-09-05 幽殇默

https://www.acwing.com/problem/content/104/

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
double a[N],s[N],n,m;
bool check(double avg)
{
    for(int i=1;i<=n;i++) s[i]=s[i-1]+a[i]-avg;
    double ans=999999;
    for(int i=0,j=m;j<=n;j++,i++)
    {
        ans=min(ans,s[i]);
        if(s[j]>ans) return true;
    }
    return false;
}
int main(void)
{
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i];
    double l=1,r=2000;
    while(r-l>1e-7)
    {
        double mid=(l+r)/2;
        if(check(mid)) l=mid;
        else r=mid;
    }
    printf("%d\\n",int(r*1000));
    return 0;
}