|
|
back to boardCommon BoardPLZ Remind me... I read a problem recently, but now I've forgotten the number... The problem : The n*m rectangle is given. You are to find the smaller or equal rect, which is in that (n*m)rect. with the maximal sum of the numbers in it. Example 3 3 -9 9 6 -45 -1 100 2 -53 0 here.... the rect. with max sum is (1,2)(2,3) => 9 6 -1 100 Please remind me the number of this problem... Edited by author 23.02.2006 03:26 Try googling for "timus rectangle maximal sum" ;) (-) - Timus-1146 "Maximum Sum" (-) Did you try googling? (-) - Thank you Dmitry and Michael!!!! You helped me a lot! (-) Of course not. I just remember most of Timus problems (-) Well you should have (+) Because it is really nice how google brings timus 1146 as the very first result on that query! |
|
|