sister_of_contestfucker's blog

By sister_of_contestfucker, history, 4 years ago, In English

I'm trying to solve this problem Link but the best approach I can come up with is (max(n,m))^3*logn . An efficient solution will be appreciated thanks.

| Write comment?
»
4 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Someone's written a partial editorial here. It has the main idea for 1060C - Maximum Subrectangle.