A15689 | Rebrending
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Kostya and Zhenya — the creators of the band "Paper" — after the release of the legendary album decided to create a new band "Day movers", for this they need to find two new people.
They invited $n$ people to the casting. The casting will last $q$ days. On the $i$ th of the days, Kostya and Zhenya want to find two people on the segment from $l_i$ to $r_i$ who are most suitable for their band. Since "Day movers" are doing a modern art, musical skills are not important to them and they look only at other signs: they want the height difference between two people to be as small as possible.
Help them, and for each day, find the minimum difference in the growth of people from the casting on this segment!
They invited $n$ people to the casting. The casting will last $q$ days. On the $i$ th of the days, Kostya and Zhenya want to find two people on the segment from $l_i$ to $r_i$ who are most suitable for their band. Since "Day movers" are doing a modern art, musical skills are not important to them and they look only at other signs: they want the height difference between two people to be as small as possible.
Help them, and for each day, find the minimum difference in the growth of people from the casting on this segment!
输入格式
In the first line you are given two integers $n$ and $q$ ( $2 \leq n \leq 3 \cdot 10^5, 1 \leq q \leq 10^6$ ) — the number of people who came to the casting and the number of casting days.
In the second line, you are given $n$ integers $a_1, a_2, a_3, \ldots, a_n$ ( $1 \leq a_i \leq n$ ) — the growth of each of the candidates.
It is also guaranteed that all $a_i$ are different.
The following $q$ lines each contains two integers $l_i$ and $r_i$ ( $1 \leq l_i < r_i \leq n$ ) — a segment of people on the $i$ th day of casting.
In the second line, you are given $n$ integers $a_1, a_2, a_3, \ldots, a_n$ ( $1 \leq a_i \leq n$ ) — the growth of each of the candidates.
It is also guaranteed that all $a_i$ are different.
The following $q$ lines each contains two integers $l_i$ and $r_i$ ( $1 \leq l_i < r_i \leq n$ ) — a segment of people on the $i$ th day of casting.
输出格式
Output $q$ lines. In the $i$ -th line there should be a minimum height difference between the two candidates on the segment on the $i$ -th day of casting.
输入输出样例
输入 #1
3 3 1 3 2 1 2 2 3 1 3
输出 #1
2 1 1
输入 #2
5 3 4 1 5 3 2 1 2 3 4 2 4
输出 #2
3 2 2
输入 #3
7 4 2 6 1 7 3 5 4 4 6 1 2 3 6 1 3
输出 #3
2 4 2 1
In the first example, the minimum difference on the segment $[1, 2]$ is $2$ , on the segment $[2, 3]$ — $1$ , on the segment $[1, 3]$ is also $1$ .
In the third example, the numbers with the minimum difference on the segment $[4, 6]$ are $3$ and $5$ ( $5 - 3 = 2$ ). On the segment $[1, 2]$ , the numbers with the minimum difference are $2$ and $6$ ( $6 - 2 = 4$ ). On the segment $[3, 6]$ , the numbers with the minimum difference are $1$ and $3$ ( $3 - 1 = 2$ ). On the segment $[1, 3]$ , the minimum difference is formed by the numbers $1$ and $2$ ( $2 - 1 = 1$ ).
In the third example, the numbers with the minimum difference on the segment $[4, 6]$ are $3$ and $5$ ( $5 - 3 = 2$ ). On the segment $[1, 2]$ , the numbers with the minimum difference are $2$ and $6$ ( $6 - 2 = 4$ ). On the segment $[3, 6]$ , the numbers with the minimum difference are $1$ and $3$ ( $3 - 1 = 2$ ). On the segment $[1, 3]$ , the minimum difference is formed by the numbers $1$ and $2$ ( $2 - 1 = 1$ ).
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted