-
Notifications
You must be signed in to change notification settings - Fork 0
/
flowerBloom.cpp
61 lines (58 loc) · 1.7 KB
/
flowerBloom.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
54
55
56
57
58
59
60
61
#include <vector>
class Solution {
public:
int minDays(vector<int>& bloomDay, int m, int k) {
int lastDay=0;
//calculate total number of days
for(int i=0; i<bloomDay.size(); i++)
if(bloomDay[i]>lastDay)
lastDay = bloomDay[i];
int lo = 0;
int hi = lastDay;
int mid;
int ctr;
int bouq_ctr;
while(lo<=hi) {
mid = (lo+hi)/2;
//calculate the number of bouquets on the mid'th day
cout<<endl<<"mid day: "<<mid<<endl;
ctr = 0;
bouq_ctr = 0;
for(int j=0; j<bloomDay.size(); j++) {
//cout<<endl<<"day "<<j<< " ";
if(bloomDay[j]<=mid)
ctr++;
else
ctr = 0;
if(ctr == k){
bouq_ctr++;
ctr = 0;
}
}
cout<<bouq_ctr;
//do usual binary search based on your result and lessen the number of days
if (bouq_ctr >= m) {
ctr = 0;
bouq_ctr = 0;
cout<< "here";
for(int j=0; j<bloomDay.size(); j++) {
//cout<<endl<<"day "<<j<< " ";
if(bloomDay[j]<=mid-1)
ctr++;
else
ctr = 0;
if(ctr == k){
bouq_ctr++;
ctr = 0;
}
}
if(bouq_ctr<m)
return mid;
hi = mid-1;
}
else
lo = mid+1;
}
return -1;
}
};