A16145 | Desorting
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Call an array $a$ of length $n$ sorted if $a_1 \leq a_2 \leq \ldots \leq a_{n-1} \leq a_n$ .
Ntarsis has an array $a$ of length $n$ .
He is allowed to perform one type of operation on it (zero or more times):
- Choose an index $i$ ( $1 \leq i \leq n-1$ ).
- Add $1$ to $a_1, a_2, \ldots, a_i$ .
- Subtract $1$ from $a_{i+1}, a_{i+2}, \ldots, a_n$ .
The values of $a$ can be negative after an operation.
Determine the minimum operations needed to make $a$ not sorted.
Ntarsis has an array $a$ of length $n$ .
He is allowed to perform one type of operation on it (zero or more times):
- Choose an index $i$ ( $1 \leq i \leq n-1$ ).
- Add $1$ to $a_1, a_2, \ldots, a_i$ .
- Subtract $1$ from $a_{i+1}, a_{i+2}, \ldots, a_n$ .
The values of $a$ can be negative after an operation.
Determine the minimum operations needed to make $a$ not sorted.
输入格式
Each test contains multiple test cases. The first line contains the number of test cases $t$ ( $1 \le t \le 100$ ). The description of the test cases follows.
The first line of each test case contains a single integer $n$ ( $2 \leq n \leq 500$ ) — the length of the array $a$ .
The next line contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $1 \leq a_i \leq 10^9$ ) — the values of array $a$ .
It is guaranteed that the sum of $n$ across all test cases does not exceed $500$ .
The first line of each test case contains a single integer $n$ ( $2 \leq n \leq 500$ ) — the length of the array $a$ .
The next line contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $1 \leq a_i \leq 10^9$ ) — the values of array $a$ .
It is guaranteed that the sum of $n$ across all test cases does not exceed $500$ .
输出格式
Output the minimum number of operations needed to make the array not sorted.
输入输出样例
输入 #1
4 2 1 1 4 1 8 10 13 3 1 3 2 3 1 9 14
输出 #1
1 2 0 3
In the first case, we can perform $1$ operation to make the array not sorted:
- Pick $i = 1$ . The array $a$ then becomes $[2, 0]$ , which is not sorted.
In the second case, we can perform $2$ operations to make the array not sorted:
- Pick $i = 3$ . The array $a$ then becomes $[2, 9, 11, 12]$ .
- Pick $i = 3$ . The array $a$ then becomes $[3, 10, 12, 11]$ , which is not sorted.
It can be proven that $1$ and $2$ operations are the minimal numbers of operations in the first and second test cases, respectively.
In the third case, the array is already not sorted, so we perform $0$ operations.
- Pick $i = 1$ . The array $a$ then becomes $[2, 0]$ , which is not sorted.
In the second case, we can perform $2$ operations to make the array not sorted:
- Pick $i = 3$ . The array $a$ then becomes $[2, 9, 11, 12]$ .
- Pick $i = 3$ . The array $a$ then becomes $[3, 10, 12, 11]$ , which is not sorted.
It can be proven that $1$ and $2$ operations are the minimal numbers of operations in the first and second test cases, respectively.
In the third case, the array is already not sorted, so we perform $0$ operations.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted