This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 3. In question 4819 (Problemsetting): think about using max flow. In question 4822 (Cosmic Station): iteratively add the leaves one by one. Given the distances of a leaf from 2 leaves, you know where on the chain between these 2 leaves the new leaf will be connected. Now, think about what you need to do when you're adding the n'th leaf. Question 4822 is easier to program than 4819, so consider that when you're solving them. 4. If you're having any problems with this HW, don't be afraid to email me....
View Full Document
- Spring '10