k级序列（构造&模拟）--牛客小白月赛84-C

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define inf 1e18
const int mod=1e9+7;
const int N=2e5+5;
int n,m;
void solve(){
	cin>>n>>m;
	int f=-inf,flag=1;
	for(int i=1;i<=n;i++){
		int x;
		cin>>x;
		int a=x-m,b=x+m;
		if(f>b){
			flag=0;
		}
		f=max(f,a);
	}
	if(flag) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int tt=1;
	cin>>tt;
	while(tt--) solve();
	return 0;
}