I finish this code, but the judger says I am out of bounds, can anyone tell me why or is there anyting wrong on other places? Thanks very much.
Begged for help.
# | 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 | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I finish this code, but the judger says I am out of bounds, can anyone tell me why or is there anyting wrong on other places? Thanks very much.
Begged for help.
In the official tutorial, we defined a dp[i][j] array which means that we consider 1~i and has j elements that haven't been deleted, I just want to ask if it is possible to solve it by redefined the dp: consider 1~i and has already use j moves. Could anyone tell me if my idea is possible to solve problem?
Name |
---|