# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | jiangly | 3578 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | tourist | 3565 |
8 | maroonrk | 3531 |
9 | Radewoosh | 3521 |
10 | Um_nik | 3482 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
Can anybody from community can help with me this question ? Its been 7hrs and I dont know why people doesnt respond to question that may look small to you but its like mount Everest for me. :/
dp[c][i] — minimal cost of painting the first i columns in NxM rectangle into a barcode the way its last stripe will be (c == 0 ? black : white).
This line checks if it is optimal to paint last a lines in black.
And this line checks if it is optimal to paint last a lines in white.
Can you please explain how the two recurrence relation is formed ?
Well, let's look on Nxi rectangle formed with the first i columns. What can we say about its last stripe? Either it's black or white and his width is ranged from x to y. Therefore, we handle 2 * (y — x + 1) variants. Let's imagine the last stripe in your subrectangle is white. It means that previous stripe's color has to be the different (black). Then, for each a x <= a <= y check the cost of oainting rectangle Nx(i-a) in stripes so it will end with the black stripe (dp[0][i-a])and add the cost of painting columns from i-a+1 to i in white (sum-of-whites(i-a+1,i)). Then we keep the best outcome.
Same thing with the case, where the last stripe in rectangle Nxi is white, but with reverse colouring.