OJ Board

Posted: **Sat Aug 12, 2006 6:50 am**

http://acmicpc-live-archive.uva.es/nuev ... php?p=3524
a problem from central europe 2005 regional
i don't have any idea. is there any efficient algorithm,or it's NP-hard?

Posted: **Sat Aug 12, 2006 3:25 pm**

I think there's a simple cubic time solution.

Just think

Posted: **Sat Aug 12, 2006 4:11 pm**

oh i see
thanks for your hint !

how to solve this problem?