32 lines
No EOL
1 KiB
Markdown
32 lines
No EOL
1 KiB
Markdown
---
|
|
id: greedy
|
|
title: "Greedy Algorithms"
|
|
author: Darren Yao
|
|
---
|
|
|
|
**Greedy algorithms** are algorithms that select the optimal choice at each step instead of looking at the solution space as a whole. This reduces the problem to a smaller problem at each step.
|
|
|
|
<!-- END DESCRIPTION -->
|
|
|
|
# Tutorials
|
|
|
|
- Intro to USACO, Chapter 9
|
|
- Interval Cover
|
|
- CPH 6
|
|
- [CPC.5](https://github.com/SuprDewd/T-414-AFLV/tree/master/05_greedy_algorithms)
|
|
|
|
# Problems
|
|
|
|
USACO
|
|
|
|
- [USACO Why Did the Cow Cross the Road](http://www.usaco.org/index.php?page=viewproblem2&cpid=714)
|
|
- [USACO Rest Stops](http://www.usaco.org/index.php?page=viewproblem2&cpid=810)
|
|
- [USACO High Card Wins](http://usaco.org/index.php?page=viewproblem2&cpid=571)
|
|
|
|
Misc
|
|
|
|
- [Sure Bet](https://csacademy.com/contest/archive/task/sure-bet/)
|
|
- [Did you Mean...](http://codeforces.com/contest/860/problem/A)
|
|
- [Permutation](http://codeforces.com/problemset/problem/864/D)
|
|
- [Bus](http://codeforces.com/problemset/problem/864/C)
|
|
- [Kayaking](http://codeforces.com/problemset/problem/863/B) |