Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

Constructing a Tree Using It's Timestamp.

Revision en1, by dusht0814, 2017-02-12 23:49:39

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:

Tags timestamp, dfs and similar, #trees

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English dusht0814 2017-02-12 23:52:43 4 Tiny change: 'Example:\n- Number' -> 'Example:\n\n\n- Number'
en2 English dusht0814 2017-02-12 23:51:26 8
en1 English dusht0814 2017-02-12 23:49:39 380 Initial revision (published)