寒假翻译题训练 2月17号

链接：https://acs.jxnu.edu.cn/problem/HDU1024

题目：

描述：

Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem.

Given a consecutive number sequence S1, S2, S3, S4 ... Sx, ... Sn (1 ≤ x ≤ n ≤ 1,000,000, -32768 ≤ Sx ≤ 32767). We define a function sum(i, j) = Si + ... + Sj (1 ≤ i ≤ j ≤ n).

Now given an integer m (m > 0), your task is to find m pairs of i and j which make sum(i1, j1) + sum(i2, j2) + sum(i3, j3) + ... + sum(im, jm) maximal (ix ≤ iy ≤ jx or ix ≤ jy ≤ jx is not allowed).

But I`m lazy, I don't want to write a special-judge module, so you don't have to output m pairs of i and j, just output the maximal summation of sum(ix, jx)(1 ≤ x ≤ m) instead. ^_^

输入：

Each test case will begin with two integers m and n, followed by n integers S1, S2, S3 ... Sn.
Process to the end of file.

输出：

Output the maximal summation described above in one line.

翻译如下

描述：

我想现在你应该ac了Ignatius和L's "Max Sum"问题。为了成为一个勇敢的ACMer，我们总是要挑战一些更加困难的题目。现在你要面对更多困难的题目。

给定一串数字序列S1, S2, S3, S4 ... Sx, ... Sn (1 ≤ x ≤ n ≤ 1,000,000, -32768 ≤ Sx ≤ 32767)。定义一个函数sum(i, j) = Si + ... + Sj (1 ≤ i ≤ j ≤ n)。
现在给定一个整数m(m > 0)，你的任务是找出m对i和j，使得sum(i1, j1) + sum(i2, j2) + sum(i3, j3) + ... + sum(im, jm)最大（题目保证不会出现ix ≤ iy ≤ jx or ix ≤ jy ≤ jx的情况）
但是我很懒，我不想写一个专门判断m对i和j的模块，所以你不需要输出m对i和j的具体情况，你只用输出sum(ix, jx)(1 ≤ x ≤ m)的最大值。^_^

输入：

每组样例包含两个整数m和n，接下来是n和整数S1, S2, S3 ... Sn。输入直到文件末尾。

输出：

对于每组样例，输出上面描述的最大sum。