101543: [AtCoder]ABC154 D - Dice in Line

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $400$ points

Problem Statement

We have $N$ dice arranged in a line from left to right. The $i$-th die from the left shows $p_i$ numbers from $1$ to $p_i$ with equal probability when thrown.

We will choose $K$ adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.

Constraints

  • $1 ≤ K ≤ N ≤ 200000$
  • $1 ≤ p_i ≤ 1000$
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:

$N$ $K$
$p_1$ ... $p_N$

Output

Print the maximum possible value of the expected value of the sum of the numbers shown.

Your output will be considered correct when its absolute or relative error from our answer is at most $10^{-6}$.


Sample Input 1

5 3
1 2 2 4 5

Sample Output 1

7.000000000000

When we throw the third, fourth, and fifth dice from the left, the expected value of the sum of the numbers shown is $7$. This is the maximum value we can achieve.


Sample Input 2

4 1
6 6 6 6

Sample Output 2

3.500000000000

Regardless of which die we choose, the expected value of the number shown is $3.5$.


Sample Input 3

10 4
17 13 13 12 15 20 10 13 17 11

Sample Output 3

32.000000000000

Input

题意翻译

### 题目描述 给出 $N$ 个骰子,我们同时投掷 $K$ 个连续骰子。求出可能的最大数学期望值。 ### 输入格式 第一行两个数,$N$ 和 $K$,含义在描述中给出 第二行 $N$ 个数,$p_1 \ldots p_N$,代表每一个骰子的面数 ### 输出格式 一行一个数,代表最大的数学期望值 ### 说明 本题使用**Special Judge**,你的答案和数据误差小于等于$10^{-6}$就会被评判对

加入题单

算法标签: