34 lines
No EOL
835 B
Text
34 lines
No EOL
835 B
Text
---
|
|
id: hld
|
|
title: "Heavy-Light Decomposition"
|
|
author: Benjamin Qi
|
|
prerequisites:
|
|
- Gold - Euler Tour on Tree
|
|
- Platinum - Range Update Range Query
|
|
description: Path and subtree updates and queries.
|
|
---
|
|
|
|
import { Problem } from "../models";
|
|
|
|
export const metadata = {
|
|
problems: {
|
|
sample: [
|
|
new Problem("YS","Vertex Set Path Composite","vertex_set_path_composite", "Normal", false, ["HLD"], ""),
|
|
],
|
|
general: [
|
|
new Problem("Plat", "Disrupt", "842", "Easy", false, ["HLD"]),
|
|
],
|
|
}
|
|
};
|
|
|
|
<problems-list problems={metadata.problems.sample} />
|
|
|
|
### Tutorial
|
|
|
|
- [Anudeep2011](https://blog.anudeep2011.com/heavy-light-decomposition/)
|
|
- [AI-Cash](http://codeforces.com/blog/entry/22072)
|
|
- [adamant](https://codeforces.com/blog/entry/53170)
|
|
|
|
### Problems
|
|
|
|
<problems-list problems={metadata.problems.general} /> |