Best Cow Fences
题号:NC50931
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 32 M,其他语言64 M
64bit IO Format: %lld

题目描述

Farmer John's farm consists of a long row of N fields. Each field contains a certain number of cows,.
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 fields, where F given as input.
Calculate the fence placement that maximizes the average, given the constraint.

输入描述:

* 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.

输出描述:

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

输入

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

输出

复制
6500