Description: Cover problem
★ Problem Description :
Communications ready n villages installation of base stations in certain villages , the village i, in which the base station to establish spending
Is Ci. We village as a point on a two-dimensional plane . For each base station , their specifications , configurations are
Same , the base station transmits a signal which can be covered with the center of the circular area of radius R m ( also the boundary
Operators covered) . Now the company hopes to use the smallest cost , making this n villages can be overwritten signal.
★ experimental tasks :
For information given the location and construction of the village station , find the minimum cost companies covering all the villages.
★ Data input :
The first line is an integer n (1 <= n <= 20) representative of a given number of villages.
The next n lines, each line has three integers xi yi ci, denote the coordinates of the village and the village built in the i-th
Takes the base station.
To Search:
File list (Check if you may need any files):
cover.cpp
Download