杭电OJ——1024 Max Sum Plus Plus 详细分析+优化全过程

最新推荐文章于 2026-05-10 10:32:28 发布

原创

最新推荐文章于 2026-05-10 10:32:28 发布 · 3.6k 阅读

标签

#ACM #acm #算法

收录于

博客详细解析了杭电OJ中一道动态规划问题——1024 Max Sum Plus Plus。通过状态转移方程的建立与优化，将二维动态规划数组退化为一维，并使用滚动数组进一步减少空间复杂度。博主通过逐步解释和优化过程，展示了如何求解以特定位置结尾的段子和最大值。

Problem Description

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 S ₁, S ₂, S ₃, S ₄ ... 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 > 0), your task is to find m pairs of i and j which make sum(i ₁, j ₁) + sum(i ₂, j ₂) + sum(i ₃, j ₃) + ... + 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. ^_^