blob: af40160d7739f775b86f90bbd09b37dda3474d8a (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
|
#include "leetcode.h"
class Solution {
public:
int maxDistance(vector<int> &position, int m) {
sort(position.begin(), position.end());
int ans = 1, i = 999999999;
while (ans < i) {
int mid = (ans + i) / 2 + 1;
if (check(position, m, mid))
ans = mid;
else
i = mid - 1;
}
return ans;
}
private:
int check(vector<int> &position, int m, int force) {
int pos = position[0];
for (auto i = 1; i < position.size() && m > 1; ++i)
if (position[i] - pos >= force) {
--m;
pos = position[i];
}
return m < 2;
}
};
int main() {
Solution obj;
vector<int> position = {1, 2, 3, 4, 7};
int m = 3;
cout << obj.maxDistance(position, m);
}
|