Non-boring sequences#4131
We were afraid of making this problem statement too boring, so we decided to keep it short.
A sequence is called non-boring if its every connected subsequence contains a unique element, i.e. an element such that no other element of that subsequence has the same value.
Given a sequence of integers, decide whether it is non-boring.
The first line contains the number of test cases . The descriptions of the test cases follow:
Each test case starts with an integer (1 \le n \le 2 \cdot 10^5) denoting the length of the sequence. In the next line the elements of the sequence follow. The elements are non-negative integers less than 10^9.
For each test case print a single line containing the word non-boring or boring.
Esempio 1