I have interesting problem from WCIP3G. I thought that is DP.
And in my DP I have 2 states.
dp[i][j] = answer for subsequence from i to j
.
Transitions obviously will be dp[i + 1][j] and dp[i][j - 1].
But how it can be written?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
I have interesting problem from WCIP3G. I thought that is DP.
And in my DP I have 2 states.
dp[i][j] = answer for subsequence from i to j
.
Transitions obviously will be dp[i + 1][j] and dp[i][j - 1].
But how it can be written?
Name |
---|
Thanks, but can you explain it?
I used a algorithm called Sliding Array,which means"滚动数组" in Chinese. Besides this,my dp state is the same as yours. dp[i][j]=max(a[i]+sum[i+1][j]-dp[i+1][j], a[j]+sum[i][j-1]-dp[i][j-1]);
Can you tell what do sliding array in detail?
"Sliding array" Means use a 1D array to store a 2D dp values
You can just implementate my code,and you will know how it works!