The nature of the greedy algorithm:
is the optimal solution of the current state, which does not consider the global.
What is the optimal solution for the current state?
Cost issues?
- Https://www.cnblogs.com/xuxiaojin/p/9400892.html (POJ 2393) This involves the cost per week, as long as the cost of the current week is the lowest possible, do not consider the costs behind.
- Https://www.cnblogs.com/xuxiaojin/p/9401179.html (POJ 3626) The maximum cost of this design to the cow to destroy the flower, as long as the current drag the maximum cost can be
The problem of interval greed?
- Https://www.cnblogs.com/xuxiaojin/p/9400645.html (POJ 1328) This allows the location of the radar to be installed into an interval on the x-axis, as long as the POS is compared to the current traversing interval.
And so on, it's all about choosing the best of the moment.
Summary of ACM greedy algorithm
