题目链接Median
问能否构成复合题意的分配,考虑到a(i) a(i+1)这个序列的中位数
和a(i)是相同的,所以对于所有中位数可以先单独做一个分组,然后取最大连续不是中位数的数的长度,减掉这个序列之前的中位数个数前缀和,然后比较一下即可。
#include <bits/stdc++.h>
#define ll long long
#define mem(a, b) memset(a, b, sizeof a)
#define ull unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define inf 0x3f3f3f3f
#define rep(i, a, b) for (auto i = a; i <= b; ++i)
#define bep(i, a, b) for (auto i = a; i >= b; --i)
#define lowbit(x) x&(-x)
#define PII pair<int, int>
#define x first
#define y second
#define PLL pair<ll, ll>
#define PI acos(-1)
#define pb push_back
#define eb emplace_back
const double eps = 1e-6;
const int N = 2e5 + 10;
using namespace std;
int mod=1e9+7;
bool st[100000+9];
void solve() {
int a,b,n,m;
memset(st,0,sizeof(st));
cin>>n>>m;
for(int i=0;i<m;i++){
cin>>a;
st[a]=true;
}st[n+1]=true;
int ast=0,akt=0,ans=0,ma=-1,sum=0;
for(int i=1;i<=n+1;i++){
if(!st[i])ans++;
else {
if(ma<=ans){
ma=ans;
akt=ast;
}
sum+=ans;
ans=0;ast++;
}
}
if(ma-akt<=sum-ma)cout<<"YES\n";
else cout<<"NO\n";
}
int main() {
ios::sync_with_stdio(0);
int tt;
cin>>tt;
while(tt--)
solve();
return 0;
}
加粗样式