ABCD
A：贪心 B：讨论 C：贪心 D：讨论
#include<iostream> #include<cstring> #include<cstdio> #include<climits> #include<algorithm> #include<queue> #include<vector> #define pii pair<int,int> #define mp make_pair #define pb push_back #define fi first #define se second using namespace std; inline int read(){ int f=1,ans=0; char c=getchar(); while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();} while(c>='0'&&c<='9'){ans=ans*10+c-'0';c=getchar();} return f*ans; } const int MAXN=1e3+11; int T,N,K; char S[MAXN]; int main(){ T=read(); while(T--){ N=read(),K=read(); scanf("%s",S+1); bool ff=1; for(int i=1;i<=K;i++) if(S[i]!=S[N-i+1]){ff=0;break;} if(!ff){printf("NO\n");continue;} int L=K+1,R=N-K; if(L>R){printf("NO\n");continue;} printf("YES\n"); }return 0; }