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 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 161 |
4 | Um_nik | 160 |
5 | atcoder_official | 159 |
6 | djm03178 | 157 |
7 | adamant | 153 |
8 | luogu_official | 150 |
9 | awoo | 149 |
10 | TheScrasse | 146 |
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:
The Tree Looks Like:
Name |
---|