A difficult problem

Revision en1, by EternalFire, 2018-08-19 11:28:10

Recently I have encountered a difficult problem.

Given a matrix with size n * m (1 <= n, m <= 1500) consist of only 0 and 1, count the number of submatrix contains exactly k 1's. (0 <= k <= 6).

Could you help me to find an approach for this problem?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English EternalFire 2018-08-19 11:29:43 7 Tiny change: 's problem?' -> 's problem? Thanks'
en1 English EternalFire 2018-08-19 11:28:10 274 Initial revision (published)