I'm trying to solve this problem Link but the best approach I can come up with is (max(n,m))^3*logn . An efficient solution will be appreciated thanks.
I'm trying to solve this problem Link but the best approach I can come up with is (max(n,m))^3*logn . An efficient solution will be appreciated thanks.
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 163 |
| 3 | awoo | 162 |
| 4 | nor | 153 |
| 5 | maroonrk | 152 |
| 6 | -is-this-fft- | 151 |
| 7 | TheScrasse | 150 |
| 8 | atcoder_official | 145 |
| 8 | Petr | 145 |
| 10 | pajenegod | 144 |
Someone's written a partial editorial here. It has the main idea for 1060C - Maximum Subrectangle.