杭电ACM OJ 1024 Max Sum Plus Plus 动态规划二维dp+滚动数组dp优化

徐乙

于 2017-11-22 21:59:05 发布

阅读量723

点赞数

CC 4.0 BY-SA版权

分类专栏：算法题文章标签：杭电ACM OJ 1024 Max Sum Plus Pl 动态规划二维dp

本文链接：https://blog.youkuaiyun.com/qq_36523667/article/details/78608748

本文详细解析杭电ACM在线判题系统OJ中编号1024的Max Sum Plus Plus问题，通过动态规划的视角，深入探讨如何使用二维动态规划求解，并进一步应用滚动数组优化技术，提升算法效率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Max Sum Plus Plus

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 32446 Accepted Submission(s): 11521

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