Orac and Medians CodeForces - 1350D（思维）

Slime has a sequence of positive integers a1,a2,…,an.

In one operation Orac can choose an arbitrary subsegment [l…r] of this sequence and replace all values al,al+1,…,ar to the value of median of {al,al+1,…,ar}.

In this problem, for the integer multiset s, the median of s is equal to the ⌊|s|+12⌋-th smallest number in it. For example, the median of {1,4,4,6,5} is 4, and the median of {1,7,5,8} is 5.

Slime wants Orac to make a1=a2=…=an=k using these operations.

Orac thinks that it is impossible, and he does not want to waste his time, so he decided to ask you if it is possible to satisfy the Slime’s requirement, he may ask you these questions several times.

Input
The first line of the input is a single integer t: the number of queries.

The first line of each query contains two integers n (1≤n≤100000) and k (1≤k≤109), the second line contains n positive integers a1,a2,…,an (1≤ai≤109)
The total sum of n is at most 100000.

Output
The output should contain t lines. The i-th line should be equal to ‘yes’ if it is possible to make all integers k in some number of operations or ‘no’, otherwise. You can print each letter in lowercase or uppercase.

Example
Input
5
5 3
1 5 2 6 1
1 6
6
3 2
1 2 3
4 3
3 1 2 3
10 3
1 2 3 4 5 6 7 8 9 10
Output
no
yes
yes
no
yes
Note
In the first query, Orac can’t turn all elements into 3.

In the second query, a1=6 is already satisfied.

In the third query, Orac can select the complete array and turn all elements into 2.

In the fourth query, Orac can’t turn all elements into 3.

In the fifth query, Orac can select [1,6] at first and then select [2,10].
思路：一开始脑子抽了写了那么多判断条件。。
仔细想想，我们只要能构造出一个kk这样的，就可以构造出题目要求的序列。如果k和一个大于k的在一块，也可以构造出这样的一个序列。如果在一个长度为3的序列中，有两个大于等于k的存在，就可以构造出这样的一个序列。例如：606113，我们想全部构造为3.我们可以构造成666663，然后再变成333333这样的。（特判n为1的时候）
代码如下：

#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int maxx=1e5+100;
int a[maxx];
int n,k;

inline bool judge0()
{
	for(int i=1;i<=n;i++)
	{
		if(a[i]==k) 
		{
			if(i-1>=1&&a[i-1]>=k) return 1;
			if(i+1<=n&&a[i+1]>=k) return 1;
			if(i-2>=1&&!((a[i-1]>k&&a[i-2]>k)||(a[i-1]<k&&a[i-2]<k))) return 1;
			if(i+2<=n&&!((a[i+1]>k&&a[i+2]>k)||(a[i+1]<k&&a[i+1]<k))) return 1;
			if(i-1>=1&&i+1<=n&&!((a[i-1]>k&&a[i+1]>k)||(a[i-1]<k&&a[i+1]<k))) return 1;
		}
	}
	for(int i=1;i<=n;)
	{
		if(i+2>n) break;
		int num=0;
		if(a[i]>=k) num++;
		if(a[i+1]>=k) num++;
		if(a[i+2]>=k) num++;
		if(num>=2) return 1;
		i++;
	}
	return 0;
	
}

int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&k);
		int flag=0;
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]==k) flag=1;
		}
		if(flag==0) cout<<"no"<<endl;
		else
		{
			int flag=0;
			if(judge0()) flag=1;
			if(flag||n==1) cout<<"yes"<<endl;
			else cout<<"no"<<endl;
		}
	}
	return 0;
}

努力加油a啊，(^o)/~