Please suggest an approach to solve this problem. (Problem Link)
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Please suggest an approach to solve this problem. (Problem Link)
Name |
---|
Firstly we have to convert the tree queries into array queries. We can perform a dfs and using start and end times , convert the tree to an array. Then each subtree is a range l to r in the array. Now according to the question we have to count the nodes in the subtree rooted at X with value between l to r. That is a range query in array which can be handled using segment tree.
According to me, it was required to run BFS/DFS from node x and check the heights of all nodes in subtree to be in range [L,R]. I constructed a directed graph and followed this approach which gave me WA. Can you tell why this approach is wrong?