XM66F - 题目

#11280. XM66F

统计

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

Ynoi 1999 Problems

This problem is prepared by ccz181078 .

给定序列 $a_1,\dots,a_n$ ，$m$ 次询问，每次询问给出 $l,r$ ，问有多少组 $(i,j,k)$ 满足 $l\le ia_j$ 。

输入格式

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

第二行 $n$ 个整数 $a_1,\dots,a_n$。

接下来 $m$ 行每行两个整数 $l,r$ 表示一个询问。

输出格式

共 $m$ 行，每行一个整数，依次表示每个询问的答案。

样例数据

样例输入

10 5
9 8 5 4 5 1 5 1 5 8
2 8
4 9
7 9
6 7
2 3

样例输出

子任务

Idea：ccz181078，Solution：ccz181078，Code：ccz181078，Data：ccz181078

所有数值为整数。

对于 $100\%$ 的数据，满足 $1\le a_i\le n$，$1\le l\le r\le n$，$n,m\le 5\times 10^5$。

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