世上最幸福的女孩 - 题目

#7495. 世上最幸福的女孩

统计

该题目在以下比赛中使用过：

Ynoi Easy Round 2015 Problems

输入格式

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

全局加（即序列的所有数加）。
查询区间最大子段和。

输出格式

第一行两个整数 $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

提示

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$。

About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
Issues must be filed in English or Chinese only.
Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0