Subrectangles problems

Правка en2, от oversolver, 2016-02-17 18:28:44

Hi people! I interested in problems with template name "Count of subrectangles" or "Best subrectangle" in rectangle. For example some well-known problems:

In given matrix of zeros and ones find subrectangle that contains only zeros and has largest area. It can be solved in O(n2).

In given matrix of integers find subrectangle with largest sum. It can be solved in O(n3).

Can you give me links or just statements on similar problems?

Here problems that i remembered:

Please, gimme other problems, any links in contests or archives:) I will add it here later.

Теги subrectangles, rectangles, problems, queries

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский oversolver 2016-02-18 16:05:08 69 new problem added
en2 Английский oversolver 2016-02-17 18:28:44 112
en1 Английский oversolver 2016-02-17 18:04:42 965 Initial revision (published)