P1404 Average

Given a sequence of length $n$, find a contiguous subarray whose average is maximized, with the subarray length $\ge m$.

The first line contains two integers $n$ and $m$. The next $n$ lines each contain an integer $a_i$, representing the $i$-th number of the sequence.

Output a single integer: $1000$ times the maximum average. If there is a fractional part, truncate it directly; do not round.

#### Constraints - For $60\%$ of the testdata, it is guaranteed that $m\le n\le 10^4$。 - For $100\%$ of the testdata, it is guaranteed that $1 \leq m\le n\le 10^5$, $0\le a_i\le2000$。 Translated by ChatGPT 5