include<bits/stdc++.h>usingnamespacestd;//二分查找函数，用于查找最大最小跳跃距离inttwo_k(intleft,intright,constvector&arr,intm){if(left>right)returnright;intmid=left+(right-left)/2;intcnt=0;intlast=0;//上一个保留的岩石