A14959 | Minimize Inversions Number
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a permutation $p$ of length $n$ .
You can choose any subsequence, remove it from the permutation, and insert it at the beginning of the permutation keeping the same order.
For every $k$ from $0$ to $n$ , find the minimal possible number of inversions in the permutation after you choose a subsequence of length exactly $k$ .
You can choose any subsequence, remove it from the permutation, and insert it at the beginning of the permutation keeping the same order.
For every $k$ from $0$ to $n$ , find the minimal possible number of inversions in the permutation after you choose a subsequence of length exactly $k$ .
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 50\,000$ ) — the number of test cases.
The first line of each test case contains one integer $n$ ( $1 \le n \le 5 \cdot 10^5$ ) — the length of the permutation.
The second line of each test case contains the permutation $p_1, p_2, \ldots, p_n$ ( $1 \le p_i \le n$ ).
It is guaranteed that the total sum of $n$ doesn't exceed $5 \cdot 10^5$ .
The first line of each test case contains one integer $n$ ( $1 \le n \le 5 \cdot 10^5$ ) — the length of the permutation.
The second line of each test case contains the permutation $p_1, p_2, \ldots, p_n$ ( $1 \le p_i \le n$ ).
It is guaranteed that the total sum of $n$ doesn't exceed $5 \cdot 10^5$ .
输出格式
For each test case output $n + 1$ integers. The $i$ -th of them must be the answer for the subsequence length of $i - 1$ .
输入输出样例
输入 #1
3 1 1 4 4 2 1 3 5 5 1 3 2 4
输出 #1
0 0 4 2 2 1 4 5 4 2 2 1 5
In the second test case:
- For the length $0$ : $[4, 2, 1, 3] \rightarrow [4, 2, 1, 3]$ : $4$ inversions.
- For the length $1$ : $[4, 2, \mathbf{1}, 3] \rightarrow [1, 4, 2, 3]$ : $2$ inversions.
- For the length $2$ : $[4, \mathbf{2}, \mathbf{1}, 3] \rightarrow [2, 1, 4, 3]$ , or $[4, 2, \mathbf{1}, \textbf{3}] \rightarrow [1, 3, 4, 2]$ : $2$ inversions.
- For the length $3$ : $[4, \mathbf{2}, \mathbf{1}, \mathbf{3}] \rightarrow [2, 1, 3, 4]$ : $1$ inversion.
- For the length $4$ : $[\mathbf{4}, \mathbf{2}, \mathbf{1}, \mathbf{3}] \rightarrow [4, 2, 1, 3]$ : $4$ inversions.
- For the length $0$ : $[4, 2, 1, 3] \rightarrow [4, 2, 1, 3]$ : $4$ inversions.
- For the length $1$ : $[4, 2, \mathbf{1}, 3] \rightarrow [1, 4, 2, 3]$ : $2$ inversions.
- For the length $2$ : $[4, \mathbf{2}, \mathbf{1}, 3] \rightarrow [2, 1, 4, 3]$ , or $[4, 2, \mathbf{1}, \textbf{3}] \rightarrow [1, 3, 4, 2]$ : $2$ inversions.
- For the length $3$ : $[4, \mathbf{2}, \mathbf{1}, \mathbf{3}] \rightarrow [2, 1, 3, 4]$ : $1$ inversion.
- For the length $4$ : $[\mathbf{4}, \mathbf{2}, \mathbf{1}, \mathbf{3}] \rightarrow [4, 2, 1, 3]$ : $4$ inversions.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted