QOJ.ac

QOJ

Time Limit: 1 s Memory Limit: 128 MB Total points: 100

#7495. 世上最幸福的女孩

Statistics

输入格式

在最后的最后,珂朵莉给了你一个长为 $n$ 的序列,有 $m$ 个操作:

  1. 全局加(即序列的所有数加)。
  2. 查询区间最大子段和。

输出格式

第一行两个整数 $n,m$。

第二行 $n$ 个数表示这个序列。

之后 $m$ 行,每行一个操作。

  • $1\ x$ : 所有数都加上 $x$。
  • $2\ l\ r$ : 查询区间 $[l,r]$ 内的最大子段和(可以不选数,此时最大子段和是 $0$)。

样例 #1

样例输入 #1

5 7
-10 -3 -2 -4 -5
2 2 4
1 5
2 2 4
1 3
2 1 5
1 2
2 3 5

样例输出 #1

0
6
18
19

提示

Idea:nzhtl1477,Solution:ccz181078,Code:nzhtl1477&w33z8kqrqk8zzzx33,Data:nzhtl1477

$1\leq n \leq 3\times 10^5$,$1 \leq m \leq 6\times 10^5$,序列中的数绝对值 $\leq 2\times 10^9$,$1$ 操作中的 $x$ 的绝对值 $\leq 5\times 10^7$。

Discussions

About Discussions

The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues. Submitting multiple issues may cause your account to be banned.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.