青蛙过桥

青蛙过桥

时间限制：1000 ms  |  内存限制：65535 KB

难度：3

描述

The annual Games in frogs' kingdom started again. The most famous game is the Ironfrog Triathlon. One test in the Ironfrog Triathlon is jumping. This project requires the frog athletes to jump over the river. The width of the river is L (1<= L <= 1000000000). There are n (0<= n <= 500000) stones lined up in a straight line from one side to the other side of the river. The frogs can only jump through the river, but they can land on the stones. If they fall into the river, they are out. The frogs was asked to jump at most m (1<= m <= n+1) times. Now the frogs want to know if they want to jump across the river, at least what ability should they have. (That is the frog's longest jump distance).

输入

The input contains several cases. The first line of each case contains three positive integer L, n, and m.
Then n lines follow. Each stands for the distance from the starting banks to the nth stone, two stone appear in one place is impossible.

输出

For each case, output a integer standing for the frog's ability at least they should have.

样例输入

6 1 2225 3 311 218

样例输出

411

 

 还是二分的思想

 #include <iostream>#include <algorithm>using namespace std;int main(void){int L, n, t;while(cin>>L>>n>>t){int low = 0;int high = L;int *dist = new int[n + 2];dist[0] = 0;dist[n + 1] = L;for(int i = 1; i <= n; ++i){cin>>dist[i];}sort(dist, dist + (n + 2));for(int i = 1; i <= n + 1; ++i){if(low < dist[i] - dist[i - 1])low = dist[i] - dist[i - 1];}while(low < high){int mid = (low + high) / 2;int nm = 0;int st = 0;for(int i = 1; i <= n + 1; ++i){if(dist[i] - st <= mid){while(dist[i] - st <= mid && i <= n + 1)i++;st = dist[--i];nm++;}}if(nm > t)low = mid + 1;elsehigh = mid;}cout<<low<<endl;delete []dist;}return 0;}