poj2018（二分+最大连续子段最大平均值）

Description

Farmer John's farm consists of a long row of N (1 <= N <= 100,000)fields. Each field contains a certain number of cows, 1 <= ncows <= 2000. 

FJ wants to build a fence around a contiguous group of these fields in order to maximize the average number of cows per field within that block. The block must contain at least F (1 <= F <= N) fields, where F given as input. 

Calculate the fence placement that maximizes the average, given the constraint. 

Input

* Line 1: Two space-separated integers, N and F. 

* Lines 2..N+1: Each line contains a single integer, the number of cows in a field. Line 2 gives the number of cows in field 1,line 3 gives the number in field 2, and so on. 

Output

* Line 1: A single integer that is 1000 times the maximal average.Do not perform rounding, just print the integer that is 1000*ncows/nfields. 

Sample Input

10 6
6 
4
2
10
3
8
5
9
4
1

Sample Output

6500

题意：
找长度不小于L 的连续的子段的最大平均值。

代码：

#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdio>
using namespace std;
double a[100009];
double sum[100009];
int main()
{
    int n,len;
    scanf("%d%d",&n,&len);
    for(int i=1;i<=n;i++)
    {
        scanf("%lf",&a[i]);
    }
    double l=-1e7;
    double r=1e7;
    while(r-l>1e-5)
    {
        double mid=(l+r)/2;
        for(int i=1;i<=n;i++)
        {
            sum[i]=sum[i-1]+a[i]-mid;
        }
        double minn=1e9;
        double maxx=-1e9;
        for(int i=len;i<=n;i++)//这里多想一下就明白了。
        {
            minn=min(sum[i-len],minn);
            maxx=max(sum[i]-minn,maxx);
        }
        if(maxx>0)
        {
            l=mid;
        }
        else
        {
            r=mid;
        }
    }
    cout<<(int)(r*1000)<<endl;
}