在前面的文章中，我们分别讲解了一维和二维动态规划问题的解题步骤与基本思路。不过，仅仅掌握基本步骤是不够的。要想熟练做出动态规划题目，还要掌握足够的解题技巧。 接下来的文章中，我会讲解动态规划问题中针对不同类型问题的小技巧。今天要讲的 ...

Given an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you need to output the maximum average value. Input: [1,12,-5,-6,50,3], ...

Given an array consisting of n integers, find the contiguous subarray whose length is greater than or equal to k that has the maximum average value. And you need to output the maximum average value.