ground underneath the fence isn't level. For straightforwardness, you can imagine that the ground level under the I-th segment is equivalent to hello. You ought to adhere to a few guidelines to fabricate the fence: the successive
Correct answer will be upvoted else Multiple Downvoted. Computer science.
ground underneath the fence isn't level. For straightforwardness, you can imagine that the ground level under the I-th segment is equivalent to hello.
You ought to adhere to a few guidelines to fabricate the fence:
the successive segments ought to have a typical side of length something like 1;
the first and the keep going areas should remain on the relating ground levels;
the segments between might be either on the ground level or higher, yet not higher than k−1 starting from the earliest stage hello (the tallness ought to be an integer
Input
The principal line contains a solitary integer t (1≤t≤104) — the number of experiments.
The main line of each experiment contains two integers n and k (2≤n≤2⋅105; 2≤k≤108) — the number of segments in the fence and the stature of each segment.
The second line of each experiment contains n integers h1,h2,… ,hn (0≤hi≤108), where hello is the ground level underneath the I-th segment.
It's dependable that the amount of n over experiments doesn't surpass 2⋅105.
Output
For each experiment print YES in case it's feasible to fabricate the fence that meets all principles. In any case, print NO.
You might print each letter regardless (for instance, YES, Yes, indeed, yEs will be generally perceived as certain reply).
Step by step
Solved in 4 steps with 1 images
