Jump

Description

There is n pillars, their heights are （A1,A2,A3,…An. You can jump at the top of the pillars. But you will lose abs(a[j]-a[i])*abs(j-i) power when you jump from i-th pillar to j-th pillar. At first you have m power. Can you jump from s-th pillar to e-th pillar?

Input

The input consists of several test cases.
Every test case is two integer n（2<=n<200）, q(1=<q<=10000).
The second line contain n integer A1, A2, A3,..An.
The next q line contain there integer s, e, m .

Output

If you can jump from s to e, with less or equal m power output “Yes”, else output “No”

Sample Input

3 3
1 2 3
1 3 2
1 2 1
1 3 1

Sample Output

Yes
Yes
No

 

 

代码

更多做题心得的详情请查看（记得关注哦）https://mp.weixin.qq.com/s?__biz=MzIyOTM4MDMxNw==&mid=2247483798&idx=1&sn=d4fbd34e50ce4efda39d7710d2dc5dc9&chksm=e842d824df3551320d7f1ed85286b2616aec419f7a852cc5c9c9f270beb237b5e6ca83166162&token=1630951018&lang=zh_CN#rd