<h1 id="heading">题目</h1>
<blockquote>
<h2 id="description">Description</h2>
<blockquote>
Now I think you have got an AC in Ignatius.L's &quot;Max Sum&quot; 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 S 1, S 2, S 3, S 4 ... S x, ... S n (1 ≤ x ≤ n ≤ 1,000,000, -32768 ≤ S x ≤ 32767). We define a function sum(i, j) = S i + ... + S j (1 ≤ i ≤ j ≤ n).
Now given an integer m (m &gt; 0), your task is to find m pairs of i and j which make sum(i 1, j 1) + sum(i 2, j 2) + sum(i 3, j 3) + ... + sum(i m, j m) maximal (i x ≤ i y ≤ j x or i x ≤ j y ≤ j x 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(i x, j x)(1 ≤ x ≤ m) instead. ^_^
 
</blockquote>
<h2 id="input">Input</h2>
<blockquote>
Each test case will begin with two integers m and n, followed by n integers S 1, S 2, S 3 ... S n. 
Process to the end of file. 
Output 
Output the maximal summation described above in one line.
</blockquote>
<h2 id="sample-input">Sample Input</h2>
<blockquote>
1 3 1 2 3 
2 6 -1 4 -2 3 -2 3
</blockquote>
<h2 id="sample-output">Sample Output</h2>
<blockquote>
6 
8
</blockquote>
</blockquote>
<h1 id="heading-1">题解</h1>
由于每个状态有两个数要考虑,因此考虑使用二元的动态规划 
<code>dp[i][j]</code> 表示到以第 <code>i</code> 个数字结尾,分成 <code>j</code> 组的最大和
当循环到数字 <code>i</code> 时,有以下几种情况:
<ul>
<li>将数字加入到已选取的组中 
<code>dp[i][j] = dp[i - 1][j] + a[i]</code></li>
<li>将数字放到新的一组(上一组可能在之前的任意位置) 
<code>dp[i][j] = max{dp[k][j - 1] + a[i]}</code></li>
</ul>
数据最大可能需要开 <code>1000000</code> 的数组,二维的 <code>dp</code> 开出来妥妥爆炸 
(按照题目,最坏情况下甚至需要 <code>long long</code> )
先压缩内存 
首先可以看出来记录组数的这一维其实只用到了当前操作的和上一次操作的数据 
因此只需要 <code>2*1000000</code> 就足够存储数据了
然后是时间优化 
直接模拟上面的代码,显然时间复杂度是 O(n&lt;sup&gt;3&lt;/sup&gt;) 
可以看出我们需要的其实是上一次的数据到 <code>i</code> 的最大值(不包括 <code>dp[i]</code> ) 
因此,在处理 <code>dp[i]</code> 时顺便维护最大值存储到数组里即可
具体操作如下( <code>int</code> 足以应付数据)
<pre style="background-color:#fff">LL Max;
for(int j = 1;j &lt;= m;j++) {
 Max = -INF;
 for(int i = j;i &lt;= n;i++) {
 dp[i] = max(dp[i - 1] + a[i],dp1[i - 1] + a[i]);
 dp1[i - 1] = Max;
 Max = max(dp[i],Max);
 }
}
</pre><h1 id="heading-2">代码</h1>
<pre style="background-color:#fff">/*
By:OhYee
Github:OhYee
HomePage:http://www.oyohyee.com
Email:oyohyee@oyohyee.com

かしこいかわいい？
エリーチカ！
要写出来Хорошо的代码哦~
*/

#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;string&gt;
#include &lt;iostream&gt;
#include &lt;vector&gt;
#include &lt;list&gt;
#include &lt;queue&gt;
#include &lt;stack&gt;
#include &lt;map&gt;
#include &lt;set&gt;
using namespace std;

typedef int LL;

const LL INF = 0x7FFFFFFF / 2;

const int maxn = 1000005;
const int maxm = 1000005;

LL dp[maxm],dp1[maxm];
int a[maxn];
int v;

bool Do() {
 int n,m;
 if(scanf(&#34;%d%d&#34;,&amp;m,&amp;n) == EOF)
 return false;

 dp[0] = dp1[0] = 0;
 for(int i = 1;i &lt;= n;i++) {
 scanf(&#34;%d&#34;,&amp;a[i]);
 dp[i] = 0;
 dp1[i] = 0;
 }

 LL Max;

 for(int j = 1;j &lt;= m;j++) {
 Max = -INF;
 for(int i = j;i &lt;= n;i++) {
 dp[i] = max(dp[i - 1] + a[i],dp1[i - 1] + a[i]);
 dp1[i - 1] = Max;
 Max = max(dp[i],Max);
 }
 }

 printf(&#34;%d\n&#34;,Max);
 return true;
}

int main() {
 while(Do());
 return 0;
}
</pre>

HDU 1024.Max Sum Plus Plus