https://codeforces.com/contest/1506/submission/146973253 Why I'm getting TLE?
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | pajenegod | 145 |
9 | Petr | 145 |
Name |
---|
Increase the size of dp,
instead of dp[m + 1][n + 1] write smth like dp[N][N] (where N > max(n, m))
because your code take time greater time , compare to what they asked it's the simpelest answer , not to write a blog for it
Ha ha don't give us lecture what to do what not