How to count the number of rectanglular submatrix with all 1s in a binary square matrix of size N in O(N^2)?
i have a solution for o(N^3)
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 152 |
10 | maroonrk | 151 |
How to count the number of rectanglular submatrix with all 1s in a binary square matrix of size N in O(N^2)?
i have a solution for o(N^3)
Название |
---|
Nice question! Like you, i am only solving the O(N^3) algorithm with two pointer technique, and i guess O(N^2 Log N) with divide and conquer maybe..
I solved it finally.
i used histograms + range in which current is minimum + radix sort to calculate the range.
Thanks anyways
.
Test your idea with this problem from COCI. My O(N^2 Log N) idea get TLE.