№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3757 |
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 164 |
4 | TheScrasse | 159 |
5 | maroonrk | 155 |
6 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Название |
---|
Say you've found places for the first $$$i$$$ knights and are looking for spots for the $$$i + 1$$$-th knight. How many of the previous knights do you actually care about in terms of where the $$$i + 1$$$-th knight can go?
The dimensions:
dp[rows][3][5][5][7]
If you think you know what to do, good luck, and I recommend recursion. Create the states in a way that will make it convenient to "shift" each knight when you place another one.
Thank you galen_colin! I tried to implement the idea again with the optimization you mentioned but unfortunately I got
TLE
!Here is my implementation including both top-down and bottom-up approaches
I appreciate your help.