OJ Board

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 ...

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 ...

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 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?