Periodic summary-greedy algorithm

Summary of # # greedy algorithm

# #poj1328
> Greedy algorithm usage points:
> Radar coverage of islands with a maximum distance of D, that is, the center of the island, D is the radius of the intersection with the coastline for the radar can be in the range
> as few radars as possible: Each island has a range of the above circle and one radar available, and an island with overlapping ranges can share a radar

# #poj1700
> Greedy algorithm use point: A: Ship from right side back to left side speed is the fastest/second fastest
> B: Ship from left side to right side, return to the shortest total time
This question needs to pay attention to the greedy strategy has two, and must judge two the result which best

# #poj2709
> Greedy algorithm point of Use: 1ml 1ml configuration with grey pigments

# #poj3069 poj2586
> The same type of question:
> Greedy algorithm point of use: make the identified points as large as possible effective coverage range

Periodic summary-greedy algorithm