forked from Debraj-Kundu/All-Leetcode-Questions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
aggresiveCow.cpp
53 lines (50 loc) · 1.1 KB
/
aggresiveCow.cpp
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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
bool isPossible(vector<int> &stalls, int k , int mid){
int cowcount = 1;
int lastPos = stalls[0];
for(int i= 0; i< stalls.size(); i++){
if(stalls[i]-lastPos >= mid){
cowcount++;
if(cowcount == k){
return true;
}
lastPos = stalls[i];
}
}
return false;
}
int aggressiveCows(vector<int> &stalls, int k)
{
sort(stalls.begin(), stalls.end());
int s = 0;
int maxi = -1;
for(int i =0;i<stalls.size();i++){
maxi = max(maxi, stalls[i]);
}
int e = maxi;
int ans = -1;
int mid = s + (e-s)/2;
while(s<=e){
if(isPossible(stalls, k , mid)){
ans = mid;
s = mid + 1;
}
else{
e = mid -1;
}
mid = s + (e-s)/2;
}
return ans;
}
int main(){
vector<int> arr(5);
arr.push_back(4);
arr.push_back(2);
arr.push_back(1);
arr.push_back(3);
arr.push_back(6);
cout<<aggressiveCows(arr,2);
}