My first blog post :) Any constructive feedback is welcome.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
My first blog post :) Any constructive feedback is welcome.
Name |
---|
I think there is a O(N * M * 2N) solution for this problem. DP[i][j][p] = solution where we currently start at point (i, j) and the first i-bits of p belongs to the (j + 1)-column and the rest of the bits belongs to the j-column. And transitions are similar to the last solution. This utilizes the 2N different values of p and q more efficiently (since in the other solution, p cannot have zero bit before the last set bit, and q cannot have set bit after the row we currently stand in).
This is what I think is the actual idea behind broken profile dp.
can you provide a link to the iterative code for the same?
https://vjudge.net/problem/22385/origin
how to solve this
Thanks you very much
Is the blog still available? I have trouble with your link.
Sorry about that. Updated the link :)
Thanks:)
Auto comment: topic has been updated by evilbuggy (previous revision, new revision, compare).
Auto comment: topic has been updated by evilbuggy (previous revision, new revision, compare).
Auto comment: topic has been updated by evilbuggy (previous revision, new revision, compare).