| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 9 | awoo | 152 |
| 10 | luogu_official | 150 |
help in dp state of zuma , 607b codeforces !
in problem zuma , why do we need a dp state like : as mentioned in tutorial
if(arr[i] == arr[i+1]) dp[i][j] = 1+dp[i+2][j]
i checked by removing this state and it gave WA .
why only these 2 dp states are not enough ! #@
dp[i][j] = 1+dp[i+1][j] and
dp[i][j] = dp[i+1][k-1] + dp[k+1][j]
CAN anyone clarify it more ? ! @
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
atlasworld | 2019-01-01 20:25:23 | 37 | Tiny change: '+1][j]\n\n\n\n\n' -> '+1][j]\n\nCAN anyone clarify it more ? ! @ \n\n\n\n\n' | |
| en1 |
|
atlasworld | 2019-01-01 20:24:25 | 445 | Initial revision (published) |
