| ENG RUS | Timus Online Judge |
Common BoardHow to solve 1119. Dynamic programming in O(mn) may get time exceeded. Posted by Li, Yi 11 Oct 2001 08:18 Re: How to solve 1119. Dynamic programming in O(mn) may get time exceeded. Posted by Tran Nam Trung (trungduck@yahoo.com) 11 Oct 2001 11:42 DP with O(k^2), good luck ;) Posted by Dinh Quang Hiep (mg9h@yahoo.com) 11 Oct 2001 12:34 Re: DP with O(k^2), good luck ;) Posted by Li, Yi 13 Oct 2001 07:06 |