## Search found 4 matches

Thu Oct 31, 2002 4:57 am
Forum: Volume 101 (10100-10199)
Topic: 10173 - Smallest Bounding Rectangle
Replies: 18
Views: 4653

### Re: thank you~~~

The largest rectangle is simply infinitely large. I think your proposition need some more definitions. Maybe you want to put the constraints on the rectangle that should have at least a certain number of points on the boundary or something else...I don't know thank Ivan Golubev and Adrian Kuegel... ...
Thu Sep 19, 2002 9:37 am
Forum: Other words
Replies: 4
Views: 2388
Thanks for your reply. :D I think this is a simple and clear solution to the problem 10354. But I still have no idea about how to record all SPT. Can we use Floyd-Warshall algorithm for problem 10331? How do we update and restore all possible paths? I don't know if it's efficient enough, but for 103...
Thu Sep 19, 2002 4:19 am
Forum: Other words
Replies: 4
Views: 2388

hi all, In this volume there are some problems involving computing every shortest path between a given pair of nodes. (like Problem 10354 and Problem 10331) In most cases, we often need only one shortest path between a given pair of nodes and thus we can use an array to record the parent of a node i...
Wed Sep 18, 2002 5:41 pm
Forum: Volume 102 (10200-10299)
Topic: 10248 - The Integer All-time Champ
Replies: 11
Views: 7330

### 10248 - The Integer All-time Champs

I think this is a truly special problem.
Can anybody give some hints about it?
I really have no idea about how to solve it, should I use greedy method or search?
Or is there any special algorithm for it?