[{"sectionTitle":"题目描述","type":"Text","text":"原题来自：USACO 2003 Mar. Green\r\n\r\n给定一个长度为 $n$ 的非负整数序列 $A$ ，求一个平均数最大的，长度不小于 $L$ 的子段。","subType":"markdown"},{"sectionTitle":"输入格式","type":"Text","text":"第一行用空格分隔的两个整数 $n$ 和 $L$；\r\n\r\n第二行为 $n$ 个用空格隔开的非负整数，表示 $A_i$。","subType":"markdown"},{"sectionTitle":"输出格式","type":"Text","text":"输出一个整数，表示这个平均数的 $1000$ 倍。不用四舍五入，直接输出。","subType":"markdown"},{"sectionTitle":"样例","type":"Sample","text":"","subType":"markdown","payload":["10 6\n6 4 2 10 3 8 5 9 4 1","6500"]},{"sectionTitle":"数据范围与提示","type":"Text","text":"$1 \\leq n \\leq 10^5,0 \\leq A_i \\leq 2000$。","subType":"markdown"}]