codeforces484D的ac源码。算法：动态规划。题意：给n个数，分成若干个连续组，每组获益为max-min，输出最大获益。-AC source of codeforces484D. Meaning of the questions: given N integers, requested to dividing into several successive groups of benefit for the max-min, output the maximum profit.