ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1146. Maximum Sum

Can anybody give me some hints on O(N^3) of this problem??
Posted by simon25hk 25 Jun 2004 16:10
Or less than O(N^3), thanks ^o^
Re: Can anybody give me some hints on O(N^3) of this problem??
Posted by Ural_??? 25 Jun 2004 18:22
you can make it on O(n^2)
How?
Posted by Vladimir Yakovlev (USU) 26 Jun 2004 21:16
I know several O(N^3) algos, but no O(N^2). I don't think O(N^2) is possible (-)
Posted by Dmitry 'Diman_YES' Kovalioff 28 Jun 2004 18:51
Re: I know several O(N^3) algos, but no O(N^2). I don't think O(N^2) is possible (-)
Posted by Polaris 9 Jun 2007 16:43
what's the O(N^3) algo?