usaco 1.3.1 Greedy Algorithm

textbook

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放最后,递归出度

最少覆盖

一次没考虑 线段端点
一次没考虑 最多木板<最多母牛

部分背包

看错最大范围WA一次
线性算法:

最大值已知,扫一遍过去

(另外发现双拼打字其实挺慢的,滚回全拼= =)