Description
The problem description for the LightOJ category "database" involves a dynamic programming task where the goal is to find the number of nodes to be lightened in the subtree of a specific node when there is a lamppost in the current node. This problem introduces a unique twist by focusing on dynamic programming on a tree structure rather than a traditional array. The solution requires calculating the number of nodes to be illuminated based on whether there is a lamppost in the current node or not. Additionally, it involves determining the number of roads that receive light from both nodes as an additional challenge
Tags
Syllabus
- Sort Student Names
- Highest Goal Scorer
- Second Highest Goal Scorer
- Highest Goal Scorer per Team
- Local Fruit Shop
Problem Set 
Free 
Intermediate 
No certificate 
-
TypeProblem Set
-
Provider
-
PricingFree
-
DifficultyIntermediate
-
CertificateNo certificate
The problem description for the LightOJ category "database" involves a dynamic programming task where the goal is to find the number of nodes to be lightened in the subtree of a specific node when there is a lamppost in the current node. This problem introduces a unique twist by focusing on dynamic programming on a tree structure rather than a traditional array. The solution requires calculating the number of nodes to be illuminated based on whether there is a lamppost in the current node or not. Additionally, it involves determining the number of roads that receive light from both nodes as an additional challenge
- Sort Student Names
- Highest Goal Scorer
- Second Highest Goal Scorer
- Highest Goal Scorer per Team
- Local Fruit Shop
