I'm interested in whether we can Construct a tree if we know the Starting Time and Ending Time of all the Vertices.
For Example: - Number of Vertices :4 - Starting time ST[i]:2 4 1 3 - Ending time FT[i]:2 4 4 4
The Tree Looks Like:
# | 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 |
Constructing a Tree Using It's Timestamp.
I'm interested in whether we can Construct a tree if we know the Starting Time and Ending Time of all the Vertices.
For Example: - Number of Vertices :4 - Starting time ST[i]:2 4 1 3 - Ending time FT[i]:2 4 4 4
The Tree Looks Like:
Name |
---|