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.
给你一个长为 $n$ 的序列 $a$，$m$ 次询问，每次查询一个区间的逆序对数。
第一行两个整数 $n,m$。
第二行 $n$ 个整数表示这个序列。
之后 $m$ 行，每行两个整数表示查询的区间。
输出 $m$ 行，每行一个整数表示这次询问的答案。
4 1
1 4 2 3
2 42$1\leq n,m \leq 10^5$，$0 \leq a_i \leq 10^9$。
我们已经有了低于 $n^{1.5}$ 的算法。
By nzhtl1477
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: