310735: CF1878A. How Much Does Daytona Cost?
Description
We define an integer to be the most common on a subsegment, if its number of occurrences on that subsegment is larger than the number of occurrences of any other integer in that subsegment. A subsegment of an array is a consecutive segment of elements in the array $a$.
Given an array $a$ of size $n$, and an integer $k$, determine if there exists a non-empty subsegment of $a$ where $k$ is the most common element.
InputEach test consists of multiple test cases. The first line contains a single integer $t$ ($1 \le t \le 1000$) — the number of test cases. The description of test cases follows.
The first line of each test case contains two integers $n$ and $k$ ($1 \le n \le 100$, $1 \le k \le 100$) — the number of elements in array and the element which must be the most common.
The second line of each test case contains $n$ integers $a_1$, $a_2$, $a_3$, $\dots$, $a_n$ ($1 \le a_i \le 100$) — elements of the array.
OutputFor each test case output "YES" if there exists a subsegment in which $k$ is the most common element, and "NO" otherwise.
You can output the answer in any case (for example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as a positive answer).
ExampleInput7 5 4 1 4 3 4 1 4 1 2 3 4 4 5 6 43 5 60 4 2 2 5 1 5 4 1 5 3 3 1 1 3 3 5 3 3 4 1 5 5Output
YES NO NO YES YES YES YESNote
In the first test case we need to check if there is a subsegment where the most common element is $4$.
On the subsegment $[2,5]$ the elements are $4, \ 3, \ 4, \ 1$.
- $4$ appears $2$ times;
- $1$ appears $1$ time;
- $3$ appears $1$ time.
This means that $4$ is the most common element on the subsegment $[2, 5]$, so there exists a subsegment where $4$ is the most common element.
Output
题目问的是在一个数组的某个连续子段中,是否存在一个整数k,它在子段中的出现次数比子段中任何其他整数都要多。
输入输出数据格式:
输入:
- 第一行包含一个整数t(1≤t≤1000),表示测试用例的数量。
- 每个测试用例包含两行:
- 第一行包含两个整数n和k(1≤n≤100,1≤k≤100),分别表示数组元素的数量和需要判断的元素。
- 第二行包含n个整数a1,a2,a3,…,an(1≤ai≤100),表示数组的元素。
输出:
- 对于每个测试用例,如果存在一个子段使得k是出现次数最多的元素,则输出"YES",否则输出"NO"。
- 答案不区分大小写,即"yEs"、"yes"、"Yes"和"YES"都会被视为肯定回答。
例如:
输入:
```
7
5 4
1 4 3 4 1
4 1
2 3 4 4
5 6
43 5 60 4 2
2 5
1 5
4 1
5 3 3 1
1 3
3
5 3
3 4 1 5 5
```
输出:
```
YES
NO
NO
YES
YES
YES
YES
```题目大意: 题目问的是在一个数组的某个连续子段中,是否存在一个整数k,它在子段中的出现次数比子段中任何其他整数都要多。 输入输出数据格式: 输入: - 第一行包含一个整数t(1≤t≤1000),表示测试用例的数量。 - 每个测试用例包含两行: - 第一行包含两个整数n和k(1≤n≤100,1≤k≤100),分别表示数组元素的数量和需要判断的元素。 - 第二行包含n个整数a1,a2,a3,…,an(1≤ai≤100),表示数组的元素。 输出: - 对于每个测试用例,如果存在一个子段使得k是出现次数最多的元素,则输出"YES",否则输出"NO"。 - 答案不区分大小写,即"yEs"、"yes"、"Yes"和"YES"都会被视为肯定回答。 例如: 输入: ``` 7 5 4 1 4 3 4 1 4 1 2 3 4 4 5 6 43 5 60 4 2 2 5 1 5 4 1 5 3 3 1 1 3 3 5 3 3 4 1 5 5 ``` 输出: ``` YES NO NO YES YES YES YES ```