added prereqs
This commit is contained in:
parent
5efae213fa
commit
41210c8506
1 changed files with 5 additions and 4 deletions
|
@ -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.
|
||||
|
|
Reference in a new issue