Hello I Have a question about directed tree, I wanna to Know find the number of topological-sorts of a directed tree in O(N ^ 2)
UPD : can help me for better order Look O(nlgn)
sorry about my bad english
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Hello I Have a question about directed tree, I wanna to Know find the number of topological-sorts of a directed tree in O(N ^ 2)
UPD : can help me for better order Look O(nlgn)
sorry about my bad english
Name |
---|
Auto comment: topic has been updated by NeverSee (previous revision, new revision, compare).
You can see this Problem from Hackerrank and if you wanna to see the solution go to the editorial of the problem.
Thanks a lot
Auto comment: topic has been updated by NeverSee (previous revision, new revision, compare).