I got wrong answer test#8, using O(n^3) algorithm.
I have checked my code for many times, but I can not find what's wrong with it.

I also had A LOT of troubles with this problem...
But one cheat is avaible :)

Fix one point (take about 100 (in fact 10 is enough :) points on each segment)
And than calculate second one for each first.
And choose minimum of received lengths...

This solution is very easy to code and gets AC.

My wrong solution failed on the first big random test...

Edited by author 20.06.2006 14:34

I've got ac now :)