问题 P: cow
内存限制：128 MB
时间限制：1.000 S
评测方式：文本比较
命题人：
提交：231
解决：78
题目描述
Xiaoming's farm consists of a long row of N (1≤N≤100,000) fields. Each field contains a certain number of cows,0≤ncows≤2000.
Xiaoming 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.
Xiaoming 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.
输入
* 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.
* 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 (1000×ncows)/nfields.
样例输入 复制
10 6
6
4
2
10
3
8
5
9
4
1样例输出 复制
6500