标签：tip 长度 mit span data- rip 代码 main mat
Start Time：2016-08-20 13:00:00 End Time：2016-08-20 18:00:00 Refresh Time：2017-11-12 19:51:52 Public
Time Limit：2s Memory Limit：64MByte
Submissions：394Solved：119
Eric has an array of integers a1,a2,...,ana1,a2,...,an. Every time, he can choose a contiguous subsequence of length kk and increase every integer in the contiguous subsequence by 11.
He wants the minimum value of the array is at least mm. Help him find the minimum number of operations needed.
标签：tip 长度 mit span data- rip 代码 main mat
原文地址：http://www.cnblogs.com/Roni-i/p/7822619.html
