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(n²).

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

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

Here problems that i remembered:

• Count of subrects with max-min<=K

• Count of subrects with ones<=K

• Count of all zero-subrects

• Count of squares with exactly K stripes

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