50 人解决，120 人已尝试。
84 份提交通过，共有 469 份提交。
5.7 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
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.
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.
10 6 6 4 2 10 3 8 5 9 4 1
6500
50 人解决，120 人已尝试。
84 份提交通过，共有 469 份提交。
5.7 EMB 奖励。