## DSU on Trees #1 Merging subsets on Tree

Hi, this post involves a fairly common technique involved in problems on Trees. The technique is called DSU on Trees - "Small to Large" The idea is used in problems…

Continue Reading DSU on Trees #1 Merging subsets on Tree

## Binary Lifting #1 CF-702E

Introduction to Binary Lifting This is a technique that is widely used to solve problems based on trees and graphs. As the name suggests, we take leaps from current node…

Continue Reading Binary Lifting #1 CF-702E

## F – LIS on Tree

Problem Statement: here There is more than one way to solve this problem. We shall see two different implementations. The first implementation is an easy version and it uses LIS in O(nlogn)…

Continue Reading F – LIS on Tree

## JTREE

Problem Statement -https://www.codechef.com/problems/JTREEhttps://www.codechef.com/problems/JTREE The problem, in short, says: You have a tree with edges directed towards the root and nodes having some tickets. Each ticket allows you to move k…