东莞营销网站建设收费标准,崇信县门户网,天眼查官网查个人,做网站前应该先出图题目很简单#xff0c;就是我们在写二分的时候#xff0c;会遇到这样的情况#xff1a; mid left (right-left)/2; if (nums k)return mid;if (numsk)left mid;if (numsk)right mid-1; 若我们debug会发现其可能会一致卡在left mid#xff0c;例如#xff08… 题目很简单就是我们在写二分的时候会遇到这样的情况 mid left (right-left)/2; if (nums k)return mid;if (numsk)left mid;if (numsk)right mid-1; 若我们debug会发现其可能会一致卡在left mid例如01那么就会一直循环 其实可以改为 mid left (right-left)/21; 那么就可以了。 #include cstdio #include cmath const int N 1e310; int n,k; int q[N];int binary_search(int left,int right){int mid;int nums0;while (leftright){nums 0;mid left (right-left)/21;for (int i 0;in;i){numsq[i]/mid;}if (nums k)return mid;if (numsk)left mid;if (numsk)right mid-1;printf(%d %d\n,left,right);}return left; } int main(){scanf(%d%d,n,k);int max_0;for (int i0;in;i){scanf(%d,q[i]);if (q[i]max_)max_ q[i];}printf(%d,binary_search(0,max_));return 0;}