3211 Now or Later

Do you want to discuss about these problems? Go now!
Users are shared (no need to re-register).

Moderator: Board moderators

Post Reply
yiuyuho
A great helper
Posts: 325
Joined: Thu Feb 21, 2002 2:00 am
Location: United States
Contact:

3211 Now or Later

Post by yiuyuho » Mon Feb 14, 2005 6:06 am

Hello,

http://acmicpc-live-archive.uva.es/nuev ... php?p=3211

Any ideas on an efficient algorithm for this? 2 teams in the actual Regional contest solved this, but I cannot find an efficient algorithm for it.

I used floyds and its O(nnnlog(n)) :-?

Thanks.

Post Reply

Return to “ACM ICPC Archive Board”