Each node of tree is having values 0 and 1. how can i find the longest path in tree connected by each node having value 1.
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | adamant | 161 |
3 | maomao90 | 160 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 149 |
7 | SecondThread | 147 |
7 | atcoder_official | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
TO FIND LONGEST PATH IN N-ary TREE
Each node of tree is having values 0 and 1. how can i find the longest path in tree connected by each node having value 1.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 |
![]() |
ashishranjan2828 | 2018-03-20 20:56:55 | 159 | Initial revision (published) |
Name |
---|