a/usaco-guide
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

added prereqs

Browse source
This commit is contained in:
Michael Cao 2020-06-04 17:32:02 -05:00
parent 5efae213fa
commit 41210c8506
1 changed files with 5 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
content/3_Gold/1_Gold_DP.md
View file

@ -3,6 +3,11 @@ slug: /gold/dp
title: "Dynamic Programming"
author: Michael Cao
order: 1
prerequisites:
- Prefix Sums
- Recursion
- Bit Operations (for Bitmask DP)
- DFS and Trees (for Tree DP)
---
<div class="syllabus-only">
@ -11,10 +16,6 @@ order: 1
<!-- END DESCRIPTION -->
## Prerequisites
Assumes familiarity with prefix sums, recursion, bit operations (for Bitmask DP), and trees (for Tree DP).
## Introduction to DP
Dynamic Programming is a very important concept which emerges in the USACO gold division and extends to the IOI. Typically, one or two problems from every contest in the gold division uses some sort of Dynamic programming. The following tutorials serve as an introduction into the mindset of Dynamic programming.