시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 64 MB | 187 | 99 | 71 | 50.714% |
You are given an array of N integers. Find a consecutive subsequence of numbers of the length at least K that has the maximal possible average.
Please note: the average of a subsequence is the sum of all the numbers in the subsequence divided by its length.
The first line of input contains two integers N (1 ≤ N ≤ 3·105) and K (1 ≤ K ≤ N). The second line of input contains N integers ai (1 ≤ ai ≤ 106).
The first and only line of output must contain the maximal possible average. An absolute deviation of ±0.001 from the official solution is permitted.
4 1 1 2 3 4
4.000000
4 2 2 4 3 4
3.666666
6 3 7 1 2 1 3 6
3.333333
Contest > Croatian Open Competition in Informatics > COCI 2014/2015 > Contest #7 5번