Break the tree

CodeChefOpen on judge ↗

A tree is an undirected connected graph without any cycles. You are given a tree with N nodes and a parameter K. Each node in the node has a positive weight W[]. The tree needs to be partitioned into at most K subtrees by removing at most K-1 edges such that the maximum weight of the resulting subtrees is as small as possible. Find that smallest value of the maximum subtree weight that can be obta

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI