Let\'s consider a long, quiet country road with houses scattered very sparsely a

Question

Let's consider a long, quiet country road with houses scattered very sparsely along it. (We can picture the road as a long line segment, with an eastern endpoint and a western endpoint.) Further, let's suppose that despite the bucolic setting, the residents of all these houses are avid cell phone users. You want to place cell phone base stations at certain points along the road, so that every house is within four miles of one of the base stations. Give an efficient algorithm that achieves this goal, using as few base stations as possible.

Explanation / Answer

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>

using namespace std;
int main() {
   int len_of_road;
   cin>>len_of_road;
   int req_stations=ceil(len_of_road/8);
   cout<<req_stations<<endl;
}
/* Explanation
Consider the road length as 9 miles, so if we place station exactly in the middle that is at the 5th mile we can cover users both sides in the range of 4 miles i.e. 5-4=1, 5+4=9. If road length is 10 miles we cannot place station in the middle(i.e at 5.5 miles) because the distance is more than 4 miles so the station can't cover residants so ceiling function we use to cover residants who are not within 4 miles range from station.
ex:
1 2 3 4 5(station) 6 7 8 9

1 2 3 4 5(station) 6 7 8 9 10(station)
*/

Related Questions

Navigate

• Browse (All)
• Browse L
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.