A13717 | Fixed Point Removal
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Let $a_1, \ldots, a_n$ be an array of $n$ positive integers. In one operation, you can choose an index $i$ such that $a_i = i$ , and remove $a_i$ from the array (after the removal, the remaining parts are concatenated).
The weight of $a$ is defined as the maximum number of elements you can remove.
You must answer $q$ independent queries $(x, y)$ : after replacing the $x$ first elements of $a$ and the $y$ last elements of $a$ by $n+1$ (making them impossible to remove), what would be the weight of $a$ ?
The weight of $a$ is defined as the maximum number of elements you can remove.
You must answer $q$ independent queries $(x, y)$ : after replacing the $x$ first elements of $a$ and the $y$ last elements of $a$ by $n+1$ (making them impossible to remove), what would be the weight of $a$ ?
输入格式
The first line contains two integers $n$ and $q$ ( $1 \le n, q \le 3 \cdot 10^5$ ) — the length of the array and the number of queries.
The second line contains $n$ integers $a_1$ , $a_2$ , ..., $a_n$ ( $1 \leq a_i \leq n$ ) — elements of the array.
The $i$ -th of the next $q$ lines contains two integers $x$ and $y$ ( $x, y \ge 0$ and $x+y < n$ ).
The second line contains $n$ integers $a_1$ , $a_2$ , ..., $a_n$ ( $1 \leq a_i \leq n$ ) — elements of the array.
The $i$ -th of the next $q$ lines contains two integers $x$ and $y$ ( $x, y \ge 0$ and $x+y < n$ ).
输出格式
Print $q$ lines, $i$ -th line should contain a single integer — the answer to the $i$ -th query.
输入输出样例
输入 #1
13 5 2 2 3 9 5 4 6 5 7 8 3 11 13 3 1 0 0 2 4 5 0 0 12
输出 #1
5 11 6 1 0
输入 #2
5 2 1 4 1 2 4 0 0 1 0
输出 #2
2 0
Explanation of the first query:
After making first $x = 3$ and last $y = 1$ elements impossible to remove, $a$ becomes $[\times, \times, \times, 9, 5, 4, 6, 5, 7, 8, 3, 11, \times]$ (we represent $14$ as $\times$ for clarity).
Here is a strategy that removes $5$ elements (the element removed is colored in red):
- $[\times, \times, \times, 9, \color{red}{5}, 4, 6, 5, 7, 8, 3, 11, \times]$
- $[\times, \times, \times, 9, 4, 6, 5, 7, 8, 3, \color{red}{11}, \times]$
- $[\times, \times, \times, 9, 4, \color{red}{6}, 5, 7, 8, 3, \times]$
- $[\times, \times, \times, 9, 4, 5, 7, \color{red}{8}, 3, \times]$
- $[\times, \times, \times, 9, 4, 5, \color{red}{7}, 3, \times]$
- $[\times, \times, \times, 9, 4, 5, 3, \times]$ (final state)
It is impossible to remove more than $5$ elements, hence the weight is $5$ .
After making first $x = 3$ and last $y = 1$ elements impossible to remove, $a$ becomes $[\times, \times, \times, 9, 5, 4, 6, 5, 7, 8, 3, 11, \times]$ (we represent $14$ as $\times$ for clarity).
Here is a strategy that removes $5$ elements (the element removed is colored in red):
- $[\times, \times, \times, 9, \color{red}{5}, 4, 6, 5, 7, 8, 3, 11, \times]$
- $[\times, \times, \times, 9, 4, 6, 5, 7, 8, 3, \color{red}{11}, \times]$
- $[\times, \times, \times, 9, 4, \color{red}{6}, 5, 7, 8, 3, \times]$
- $[\times, \times, \times, 9, 4, 5, 7, \color{red}{8}, 3, \times]$
- $[\times, \times, \times, 9, 4, 5, \color{red}{7}, 3, \times]$
- $[\times, \times, \times, 9, 4, 5, 3, \times]$ (final state)
It is impossible to remove more than $5$ elements, hence the weight is $5$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted