leetcode

0 class Solution {

1 public:

2 int minSpeedOnTime(vector<int> &dist, double hour) {

3 int low = 1, high = 10000000;

4 int res = -1;

5 while (low <= high) {

6 int mid = low + (high - low) / 2;

7 double time = 0;

8 for (int i = 0; i < dist.size() - 1; i++)

9 time += ceil((double)dist[i] / mid);

10 time += (double)dist.back() / mid;

11 if (time <= hour) {

12 res = mid;

13 high = mid - 1;

14 } else

15 low = mid + 1;

16 }

17 return res;

18 }

19 };