英文题翻译2

Max Sum Plus Plus | JXNUOJ

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.

翻译：

现在我认为你已经在Ignatius得到AC，为了成为一个勇敢的ACMer，我们一直要用更难的问题去挑战自己。现在你面临一个更困难的问题。
给一个连续数列S1,S2,S3,S4…Sx,Sn(1<=x<=n<=1000000,-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或者ix<=jy<=jx是不允许）。
但是我很懒惰，我不想写一个特别的判定单元，所以你不需要输出m对i和j,只需要输出sum(ix,jx)（1<=x<=m)最大的和。

每个测试用例以两个整数m和n开始，然后有n个整数S1,S2,S3…Sn，处理到文件末尾。

在一行中输出上述最大总和。