A15117 | The Ultimate LIS Problem
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
It turns out that this is exactly the $100$ -th problem of mine that appears in some programming competition. So it has to be special! And what can be more special than another problem about LIS...
You are given a permutation $p_1, p_2, \ldots, p_{2n+1}$ of integers from $1$ to $2n+1$ . You will have to process $q$ updates, where the $i$ -th update consists in swapping $p_{u_i}, p_{v_i}$ .
After each update, find any cyclic shift of $p$ with $LIS \le n$ , or determine that there is no such shift. (Refer to the output section for details).
Here $LIS(a)$ denotes the length of [longest strictly increasing subsequence](https://en.wikipedia.org/wiki/Longest_increasing_subsequence) of $a$ .
Hacks are disabled in this problem. Don't ask why.
You are given a permutation $p_1, p_2, \ldots, p_{2n+1}$ of integers from $1$ to $2n+1$ . You will have to process $q$ updates, where the $i$ -th update consists in swapping $p_{u_i}, p_{v_i}$ .
After each update, find any cyclic shift of $p$ with $LIS \le n$ , or determine that there is no such shift. (Refer to the output section for details).
Here $LIS(a)$ denotes the length of [longest strictly increasing subsequence](https://en.wikipedia.org/wiki/Longest_increasing_subsequence) of $a$ .
Hacks are disabled in this problem. Don't ask why.
输入格式
The first line of the input contains two integers $n, q$ ( $2 \le n \le 10^5$ , $1 \le q \le 10^5$ ).
The second line of the input contains $2n+1$ integers $p_1, p_2, \ldots, p_{2n+1}$ ( $1 \le p_i \le 2n+1$ , all $p_i$ are distinct) — the elements of $p$ .
The $i$ -th of the next $q$ lines contains two integers $u_i, v_i$ ( $1 \le u_i, v_i \le 2n+1$ , $u_i \neq v_i$ ) — indicating that you have to swap elements $p_{u_i}, p_{v_i}$ in the $i$ -th update.
The second line of the input contains $2n+1$ integers $p_1, p_2, \ldots, p_{2n+1}$ ( $1 \le p_i \le 2n+1$ , all $p_i$ are distinct) — the elements of $p$ .
The $i$ -th of the next $q$ lines contains two integers $u_i, v_i$ ( $1 \le u_i, v_i \le 2n+1$ , $u_i \neq v_i$ ) — indicating that you have to swap elements $p_{u_i}, p_{v_i}$ in the $i$ -th update.
输出格式
After each update, output any $k$ $(0 \le k \le 2n)$ , such that the length of the longest increasing subsequence of $(p_{k+1}, p_{k+2}, \ldots, p_{2n+1}, p_1, \ldots, p_k)$ doesn't exceed $n$ , or $-1$ , if there is no such $k$ .
输入输出样例
输入 #1
2 6 1 2 3 4 5 1 5 1 5 4 5 5 4 1 4 2 5
输出 #1
-1 -1 2 -1 4 0
After the first update, our permutation becomes $(5, 2, 3, 4, 1)$ . We can show that all its cyclic shifts have $LIS \ge 3$ .
After the second update, our permutation becomes $(1, 2, 3, 4, 5)$ . We can show that all its cyclic shifts have $LIS \ge 3$ .
After the third update, our permutation becomes $(1, 2, 3, 5, 4)$ . Its shift by $2$ is $(3, 5, 4, 1, 2)$ , and its $LIS = 2$ .
After the fourth update, our permutation becomes $(1, 2, 3, 4, 5)$ . We can show that all its cyclic shifts have $LIS \ge 3$ .
After the fifth update, our permutation becomes $(4, 2, 3, 1, 5)$ . Its shift by $4$ is $(5, 4, 2, 3, 1)$ , and its $LIS = 2$ .
After the fifth update, our permutation becomes $(4, 5, 3, 1, 2)$ . Its shift by $0$ is $(4, 5, 3, 1, 2)$ , and its $LIS = 2$ .
After the second update, our permutation becomes $(1, 2, 3, 4, 5)$ . We can show that all its cyclic shifts have $LIS \ge 3$ .
After the third update, our permutation becomes $(1, 2, 3, 5, 4)$ . Its shift by $2$ is $(3, 5, 4, 1, 2)$ , and its $LIS = 2$ .
After the fourth update, our permutation becomes $(1, 2, 3, 4, 5)$ . We can show that all its cyclic shifts have $LIS \ge 3$ .
After the fifth update, our permutation becomes $(4, 2, 3, 1, 5)$ . Its shift by $4$ is $(5, 4, 2, 3, 1)$ , and its $LIS = 2$ .
After the fifth update, our permutation becomes $(4, 5, 3, 1, 2)$ . Its shift by $0$ is $(4, 5, 3, 1, 2)$ , and its $LIS = 2$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted