EternalFire's blog

By EternalFire, history, 6 years ago, In English

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? Thanks

  • Vote: I like it
  • -21
  • Vote: I do not like it

»
6 years ago, # |
Rev. 2   Vote: I like it +6 Vote: I do not like it