Puzzle: Find largest rectangle (maximal rectangle problem)?

Lassevk I found the referenced article, from DDJ: The Maximal Rectangle Problem.

This one is O(mn) time, which is optimal. – j_random_hacker Jan 11 at 17:28.

Here's a page that has some code and some analysis. Your particular problem begins a bit down on the page, search the page for the text maximal rectangle problem. seas.gwu.edu/~simhaweb/cs151/lectures/mo....

1 Good explanations on that page but it only gives a O(mn^2) algorithm, which is not optimal (see Mark Renouf's answer, which is). -1. – j_random_hacker Jan 11 at 17:30.

Lassevk // 4. Outer double-for-loop to consider all possible positions // for topleft corner. For (int i=0; I For (int a=i; a.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.