A16056 | Destroyer
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
John is a lead programmer on a destroyer belonging to the space navy of the Confederacy of Independent Operating Systems. One of his tasks is checking if the electronic brains of robots were damaged during battles.
A standard test is to order the robots to form one or several lines, in each line the robots should stand one after another. After that, each robot reports the number of robots standing in front of it in its line.
 An example of robots' arrangement (the front of the lines is on the left). The robots report the numbers above.The $i$ -th robot reported number $l_i$ . Unfortunately, John does not know which line each robot stands in, and can't check the reported numbers. Please determine if it is possible to form the lines in such a way that all reported numbers are correct, or not.
A standard test is to order the robots to form one or several lines, in each line the robots should stand one after another. After that, each robot reports the number of robots standing in front of it in its line.
 An example of robots' arrangement (the front of the lines is on the left). The robots report the numbers above.The $i$ -th robot reported number $l_i$ . Unfortunately, John does not know which line each robot stands in, and can't check the reported numbers. Please determine if it is possible to form the lines in such a way that all reported numbers are correct, or not.
输入格式
The first line contains a single integer $t$ ( $1 \leq t \leq 100$ ), denoting the number of test cases.
The first line in each test case contains a single integer $n$ ( $1 \le n \le 100$ ) — the number of robots.
The second line in each test case contains $n$ integers $l_1, l_2, \ldots, l_n$ ( $0 \leq l_i < 100$ ), $l_i$ is equal to the number of robots in front of the $i$ -th robot in its line.
The sum of $n$ over all test cases won't exceed $200$ .
The first line in each test case contains a single integer $n$ ( $1 \le n \le 100$ ) — the number of robots.
The second line in each test case contains $n$ integers $l_1, l_2, \ldots, l_n$ ( $0 \leq l_i < 100$ ), $l_i$ is equal to the number of robots in front of the $i$ -th robot in its line.
The sum of $n$ over all test cases won't exceed $200$ .
输出格式
For each test case, output "YES", if there exists a robot arrangement consistent with robots' reports. Otherwise, output "NO".
You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.
You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.
输入输出样例
输入 #1
5 6 0 1 2 0 1 0 9 0 0 0 0 1 1 1 2 2 3 0 0 2 1 99 5 0 1 2 3 4
输出 #1
YES YES NO NO YES
Example arrangement consistent with robot statements from the first example test case:
Example arrangement consistent with robot statements from the second example is shown in the statement.
In the third test case, the third robot claims that there are two machines in front of it. In such a case, the robot directly in front of it would have one machine in front. No robot claims that, so there is no valid arrangement.
Example arrangement consistent with robot statements from the second example is shown in the statement.
In the third test case, the third robot claims that there are two machines in front of it. In such a case, the robot directly in front of it would have one machine in front. No robot claims that, so there is no valid arrangement.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted