【leetcode】689. Maximum Sum of 3 Non-Overlapping Subarrays
题目如下:Inagivenarraynumsofpositiveintegers,findthreenon-overlappingsubarrayswithmaximumsum.Eachsubarraywillbeofsizek,andwewanttomaximizethesumofall3*kentries.Returntheresultasalistofindicesrepresentingt