← 返回题目

题库练习 LuoTianyi and the Function

← 上一题下一题 →

A15917 | $LuoTianyi and the Function$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

LuoTianyi gives you an array $a$ of $n$ integers and the index begins from $1$ . Define $g(i,j)$ as follows: - $g(i,j)$ is the largest integer $x$ that satisfies $\{a_p:i\le p\le j\}\subseteq\{a_q:x\le q\le j\}$ while $i \le j$ ; - and $g(i,j)=0$ while $i>j$ . There are $q$ queries. For each query you are given four integers $l,r,x,y$ , you need to calculate $\sum\limits_{i=l}^{r}\sum\limits_{j=x}^{y}g(i,j)$ .

输入格式

The first line contains two integers $n$ and $q$ ( $1\le n,q\le 10^6$ ) — the length of the array $a$ and the number of queries. The second line contains $n$ integers $a_1,a_2,\ldots,a_n$ ( $1\le a_i\le n$ ) — the elements of the array $a$ . Next $q$ lines describe a query. The $i$ -th line contains four integers $l,r,x,y$ ( $1\le l\le r\le n, 1\le x\le y\le n$ ) — the integers in the $i$ -th query.

输出格式

Print $q$ lines where $i$ -th line contains one integer — the answer for the $i$ -th query.

输入输出样例

输入 #1

6 4
1 2 2 1 3 4
1 1 4 5
2 3 3 3
3 6 1 2
6 6 6 6

输出 #1

输入 #2

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

输出 #2

C++ 编辑器

输入

输出