The 3rd Universal Cup Finals is coming! Join our Warm-up Game and Prediction Game and win the prizes! Learn more...
我们担心题目描述太无聊，所以决定简短一点。 如果一个序列的每一个连续子序列都包含一个唯一元素（即在该子序列中没有其他元素与其值相同），则称该序列为 non-boring。 给定一个整数序列，判断它是否为 non-boring。
输入的第一行包含测试用例的数量 $T$。接下来是各测试用例的描述： 每个测试用例的第一行包含一个整数 $n$ ($1 \le n \le 200\,000$)，表示序列的长度。 下一行包含 $n$ 个序列元素，以空格分隔。这些元素是小于 $10^9$ 的非负整数。
按输入顺序输出每个测试用例的答案。对于每个测试用例，输出一行，包含单词 non-boring 或 boring。
4 5 1 2 3 4 5 5 1 1 1 1 1 5 1 2 3 2 1 5 1 1 2 1 1
non-boring boring non-boring boring
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: