usaco 1.3.1 Greedy Algorithm

最新推荐文章于 2021-05-26 01:11:50 发布

原创最新推荐文章于 2021-05-26 01:11:50 发布 · 478 阅读

CC 4.0 BY-SA版权

文章标签：

33 篇文章

订阅专栏

26 篇文章

订阅专栏

本文介绍了贪婪算法的基本思想：从最优的小规模解决方案构建大规模解决方案，并始终保持最佳选择。文章通过几个具体例子阐述了如何应用这一策略，同时也提到了贪婪算法的优点如快速执行和较低的空间复杂度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Notes

The basic idea behind greedy algorithms is to build large solutions up from smaller ones.
Unlike other approaches, however, greedy algorithms keep only the best solution they find as they go along.
Greedy algorithms are fast, generally linear to quadratic and require little extra memory.
at each step, there is always an optimal answer which is a superset of the current state.
If the greedy algorithm finds the correct answer, go for it, but don’t get suckered into thinking the greedy solution will work for all problems.
例题:有限种数的排序:桶排
例题:图论搜索入度为0放最后,递归出度