Walking Boy

题目描述

One of the SWERC judges has a dog named Boy. Besides being a good competitive programmer, Boy loves fresh air, so she wants to be walked at least twice a day. Walking Boy requires $ 120 $ consecutive minutes. Two walks cannot overlap, but one can start as soon as the previous one has finished. Boy before and after getting ACCEPTED on this problem. Today, the judge sent $ n $ messages to the SWERC Discord server. The $ i $ -th message was sent $ a_i $ minutes after midnight. You know that, when walking Boy, the judge does not send any messages, but he can send a message right before or right after a walk. Is it possible that the judge walked Boy at least twice today? Note that a day has $ 1440 $ minutes, and a walk is considered to happen today if it starts at a minute $ s \ge 0 $ and ends right before a minute $ e \le 1440 $ . In that case, it must hold that $ e - s = 120 $ and, for every $ i = 1, \, 2 \, \dots, \, n $ , either $ a_i \le s $ or $ a_i \ge e $ .

输入输出格式

输入格式

Each test contains multiple test cases. The first line contains an integer $ t $ ( $ 1 \le t \le 100 $ ) — the number of test cases. The descriptions of the $ t $ test cases follow. The first line of each test case contains an integer $ n $ ( $ 1 \le n \le 100 $ ) — the number of messages sent by the judge. The second line of each test case contains $ n $ integers $ a_1, \, a_2, \, \dots, \, a_n $ ( $ 0 \le a_1 < a_2 < \cdots < a_n < 1440 $ ) — the times at which the messages have been sent (in minutes elapsed from midnight).

输出格式

For each test case, output one line containing $ \texttt{YES} $ if it is possible that Boy has been walked at least twice, and $ \texttt{NO} $ otherwise.

输入输出样例

输入样例 #1

6
14
100 200 300 400 500 600 700 800 900 1000 1100 1200 1300 1400
12
100 200 300 400 600 700 800 900 1100 1200 1300 1400
13
100 200 300 400 500 600 700 800 900 1100 1200 1300 1400
13
101 189 272 356 463 563 659 739 979 1071 1170 1274 1358
1
42
5
0 1 2 3 4

输出样例 #1

NO
YES
NO
YES
YES
YES

说明

In the first test case, the judge has sent a message at each time multiple of $ 100 $ (excluding $ 0 $ ). It is impossible that he has walked Boy even once. In the second test case, the times are the same as above, but $ 500 $ and $ 1000 $ are missing. The judge could have walked Boy, for instance, during the time intervals $ [440, 560] $ and $ [980, 1100] $ . The situation is illustrated in the picture below, where the walks are represented by green intervals.  $ $ $ $ $$</p><p>In the <span class="tex-font-style-bf">third test case</span>, the times are the same as in the first test case, but $ 1000 $ is missing. The judge could have walked Boy at most once.</p><p>In the <span class="tex-font-style-bf">fourth test case</span>, Boy could have been walked during the time intervals $ \[739, 859\] $ and $ \[859, 979\]$. 

**题目大意：**

有一个名为 Boy 的狗，每天需要至少被遛两次，每次遛弯需要连续的 120 分钟。两次遛弯不能重叠，但可以在上一次结束后立即开始。今天，遛狗的裁判在 SWERC Discord 服务器上发送了 $ n $ 条消息，每条消息是在午夜后的 $ a_i $ 分钟发送的。当遛狗时，裁判不会发送任何消息，但可以在遛弯前或遛弯后立即发送。需要判断裁判今天是否有可能至少遛了 Boy 两次。

注意，一天有 1440 分钟，如果遛弯从分钟 $ s $ 开始并在分钟 $ e $ 结束（$ e \le 1440 $），则必须满足 $ e - s = 120 $，并且对于每个 $ i = 1, 2, \dots, n $，要么 $ a_i \le s $ 要么 $ a_i \ge e $。

**输入输出数据格式：**

**输入格式：**

每个测试包含多个测试用例。第一行包含一个整数 $ t $（$ 1 \le t \le 100 $）——测试用例的数量。接下来是 $ t $ 个测试用例的描述。

每个测试用例的第一行包含一个整数 $ n $（$ 1 \le n \le 100 $）——裁判发送的消息数量。

每个测试用例的第二行包含 $ n $ 个整数 $ a_1, a_2, \dots, a_n $（$ 0 \le a_1 < a_2 < \cdots < a_n < 1440 $）——消息发送的时间（从午夜开始的分钟数）。

**输出格式：**

对于每个测试用例，如果有可能 Boy 至少被遛了两次，输出一行包含 `YES`，否则输出 `NO`。**题目大意：** 有一个名为 Boy 的狗，每天需要至少被遛两次，每次遛弯需要连续的 120 分钟。两次遛弯不能重叠，但可以在上一次结束后立即开始。今天，遛狗的裁判在 SWERC Discord 服务器上发送了 $ n $ 条消息，每条消息是在午夜后的 $ a_i $ 分钟发送的。当遛狗时，裁判不会发送任何消息，但可以在遛弯前或遛弯后立即发送。需要判断裁判今天是否有可能至少遛了 Boy 两次。 注意，一天有 1440 分钟，如果遛弯从分钟 $ s $ 开始并在分钟 $ e $ 结束（$ e \le 1440 $），则必须满足 $ e - s = 120 $，并且对于每个 $ i = 1, 2, \dots, n $，要么 $ a_i \le s $ 要么 $ a_i \ge e $。 **输入输出数据格式：** **输入格式：** 每个测试包含多个测试用例。第一行包含一个整数 $ t $（$ 1 \le t \le 100 $）——测试用例的数量。接下来是 $ t $ 个测试用例的描述。 每个测试用例的第一行包含一个整数 $ n $（$ 1 \le n \le 100 $）——裁判发送的消息数量。 每个测试用例的第二行包含 $ n $ 个整数 $ a_1, a_2, \dots, a_n $（$ 0 \le a_1 < a_2 < \cdots < a_n < 1440 $）——消息发送的时间（从午夜开始的分钟数）。 **输出格式：** 对于每个测试用例，如果有可能 Boy 至少被遛了两次，输出一行包含 `YES`，否则输出 `NO`。