blob: 21dafbfca81509f35e3cc32023a313aab3b7f1c5 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
---
id: dp-more
title: "More DP (come up with better name?)"
author: "?"
description: "?"
frequency: 1
---
D&C:
Mowing: http://www.usaco.org/index.php?page=viewproblem2&cpid=926
Miscellaneous Techniques: https://codeforces.com/blog/entry/47764
<Info title="Pro Tip">
There are [plenty](https://github.com/bqi343/USACO/blob/master/Contests/USACO%20Links/Division-Specific/Platinum.md) of Platinum DP problems that are not covered by this guide; we recommend that you work through these on your own.
</Info>
<Optional title="Application">
Queue w/ Two Stacks is used to remove a factor of $O(\log N)$ in [USACO Plat - Mowing Mischief](http://www.usaco.org/index.php?page=viewproblem2&cpid=926).
</Optional>
|
