Codeforces Global Round 2
D
Frets On Fire
Codeforces
1800
原题
← CE →
翻译中…

Miyako came to the flea kingdom with a ukulele. She became good friends with local flea residents and played beautiful music for them every day.

翻译中…

In return, the fleas made a bigger ukulele for her: it has $n$ strings, and each string has $(10^{18} + 1)$ frets numerated from $0$ to $10^{18}$. The fleas use the array $s_1, s_2, \ldots, s_n$ to describe the ukulele's tuning, that is, the pitch of the $j$-th fret on the $i$-th string is the integer $s_i + j$.

翻译中…

Miyako is about to leave the kingdom, but the fleas hope that Miyako will answer some last questions for them.

翻译中…

Each question is in the form of: "How many different pitches are there, if we consider frets between $l$ and $r$ (inclusive) on all strings?"

翻译中…

Miyako is about to visit the cricket kingdom and has no time to answer all the questions. Please help her with this task!

翻译中…

Formally, you are given a matrix with $n$ rows and $(10^{18}+1)$ columns, where the cell in the $i$-th row and $j$-th column ($0 \le j \le 10^{18}$) contains the integer $s_i + j$. You are to answer $q$ queries, in the $k$-th query you have to answer the number of distinct integers in the matrix from the $l_k$-th to the $r_k$-th columns, inclusive.

翻译中…

Input

翻译中…

The first line contains an integer $n$ ($1 \leq n \leq 100\,000$) — the number of strings.

翻译中…

The second line contains $n$ integers $s_1, s_2, \ldots, s_n$ ($0 \leq s_i \leq 10^{18}$) — the tuning of the ukulele.

翻译中…

The third line contains an integer $q$ ($1 \leq q \leq 100\,000$) — the number of questions.

翻译中…

The $k$-th among the following $q$ lines contains two integers $l_k$,$r_k$ ($0 \leq l_k \leq r_k \leq 10^{18}$) — a question from the fleas.

翻译中…

Output

翻译中…

Output one number for each question, separated by spaces — the number of different pitches.

翻译中…

Note

翻译中…

For the first example, the pitches on the $6$ strings are as follows.

翻译中…

$$ \begin{matrix} \textbf{Fret} & \textbf{0} & \textbf{1} & \textbf{2} & \textbf{3} & \textbf{4} & \textbf{5} & \textbf{6} & \textbf{7} & \ldots \\ s_1: & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 & \dots \\ s_2: & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & \dots \\ s_3: & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & \dots \\ s_4: & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & \dots \\ s_5: & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & \dots \\ s_6: & 9 & 10 & 11 & 12 & 13 & 14 & 15 & 16 & \dots \end{matrix} $$

翻译中…

There are $5$ different pitches on fret $7$ — $8, 10, 11, 12, 16$.

翻译中…

There are $10$ different pitches on frets $0, 1, 2$ — $1, 2, 3, 4, 5, 6, 7, 9, 10, 11$.

翻译中…

样例

Input #1
6
3 1 4 1 5 9
3
7 7
0 2
8 17
Output #1
5 10 18
InputCopy OutputCopy
Input #2
2
1 500000000000000000
2
1000000000000000000 1000000000000000000
0 1000000000000000000
Output #2
2 1500000000000000000
InputCopy OutputCopy
题目信息
题号
1119D
时间限制
1.5 s
内存限制
256 MB
标签
二分
排序

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。