28 lines
841 B
Text
28 lines
841 B
Text
|
---
|
||
|
id: dp-ranges
|
||
|
title: "Dynamic Programming on Ranges"
|
||
|
author: Michael Cao
|
||
|
prerequisites:
|
||
|
- Gold - Introduction to Dynamic Programming
|
||
|
description: Solving the problem on every contiguous subarray of the original array.
|
||
|
---
|
||
|
|
||
|
import { Problem } from "../models";
|
||
|
|
||
|
export const metadata = {
|
||
|
problems: {
|
||
|
general: [
|
||
|
new Problem("Gold", "248", "647", "Easy", false, ["Range DP"]),
|
||
|
new Problem("CSES", "Empty String", "1080", "Normal", false, ["Range DP"]),
|
||
|
new Problem("CF", "Zuma", "problemset/problem/607/B", "Normal", false, ["Range DP"]),
|
||
|
new Problem("Plat", "Greedy Pie Eaters", "972", "Normal", false, ["Range DP"]),
|
||
|
new Problem("Plat", "Subsequence Reversal", "698", "Normal", false, ["Range DP"]),
|
||
|
]
|
||
|
}
|
||
|
};
|
||
|
|
||
|
## Problems
|
||
|
|
||
|
<problems-list problems={metadata.problems.general} />
|
||
|
|
||
|
* TC SRM 787 500
|