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.
这是一道模板题。
您需要写一种数据结构（可参考题目标题），来维护一个序列，其中需要提供以下操作：
翻转一个区间，例如原有序序列是 5 4 3 2 1，翻转区间是 $ [2, 4] $ 的话，结果是 5 2 3 4 1。
第一行为 $ n, m $，$ n $ 表示初始序列有 $ n $ 个数，这个序列依次是 $ \{ 1, 2, \ldots n - 1, n \} $，$ m $ 表示翻转操作次数。
接下来 $ m $ 行每行两个数 $ [l, r] $，数据保证 $ 1 \leq l \leq r \leq n $。
输出一行 $ n $ 个数字，表示原始序列经过 $ m $ 次变换后的结果。
5 3
1 3
1 3
1 44 3 2 1 5$ 1 \leq n, m \leq 10 ^ 5 $
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.
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: