34 lines
868 B
Text
34 lines
868 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.
|
|
frequency: 2
|
|
---
|
|
|
|
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", "Hard", false, ["Range DP"]),
|
|
new Problem("Plat", "Subsequence Reversal", "698", "Hard", false, ["Range DP"]),
|
|
]
|
|
}
|
|
};
|
|
|
|
## Tutorial
|
|
|
|
??
|
|
|
|
## Problems
|
|
|
|
<problems-list problems={metadata.problems.general} />
|
|
|
|
* TC SRM 787 500
|