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 | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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 |
---|