可以线段树打区间标记或者扫描线用线段树维护时间，但主要问题都是信息的合并。
信息可以写成先减若干次，然后加若干次，然后执行操作四（可能没有），然后再减若干次，然后再加若干次，然后执行操作三（可能没有）最后再加若干次。合并的时候要讨论一下后面的操作四是否能回到之前的操作三。
时间复杂度 $O(n+q\log n)$。
QOJ.ac
QOJ
As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
Discussion #151 for Problem #6733. Moniphant Sleep
Type: Editorial
Status: Open
Posted by: jiangly
Posted at: 2025-12-12 23:35:45
Last updated: 2025-12-12 23:35:51
题解
Comments
No comments yet.