Search found 2 matches

by moham_87
Tue Aug 22, 2006 11:33 am
Forum: Volume 108 (10800-10899)
Topic: 10821 - Constructing BST
Replies: 10
Views: 4368

1. I check the input N & H, if N is over 2^H-1 or less than H, and print impossible. why should u check if N is less than H? I think if N<H, it should work The problem statement says: In this problem, you have to find the order of 1 to N integers such that the BST constructed by them has height of ...
by moham_87
Mon Jul 31, 2006 2:37 pm
Forum: ACM ICPC Archive Board
Topic: Problem B S.America 2006
Replies: 0
Views: 2142

Problem B S.America 2006

Hi all,

how could i find if there is no path to an informer, surrounded by radars (as informer 2 in the mentioned problem)

here is a link to the problem:
http://acmicpc-live-archive.uva.es/nuev ... php?p=3469

Thnx

Go to advanced search