程序解决部队中共有N个士兵，每个士兵有各自的能力指数Xi，在一次演练中，指挥部确定

了M个需要防守的地点，按重要程度从低到高排序，依次以数字1到M标注每个地点的重要程度，指挥部将选择M个士兵依次进入指定地点进行防守任务，能力指数为X的士兵防守重要程度为Y的地点将得到X*Y的参考指数。现在士兵们排成一排，请你选择出连续的M个士兵依次参加防守,使得总的参考指数值最大的问题-A total of N forces soldiers, each with its own capability index Xi, during a drill, headquarters to determine

The need to defend the place of M, according to the importance of the sort　low to high, followed by numbers 1 to M mark the importance of each location, the headquarters will　M soldiers turn into the designated place for defensive duties, the ability to index for X soldiers defensive importance will be the location for the Y X* Y of the reference index. The soldiers lined up in a row now, please　a contiguous sequence of M soldiers participated in the defense, so that the total value of the maximum reference index.