Examination process
The state is better, just-field configuration found wrong, life and death can not compile F5 to run
Had to give up, T1 interval simple DP, the result of violence hit 2h, ah force desperate code
T2 a look greedy cheat score, write a lot of cmp finally found life difficult to beat the meet point A and B are particularly large
Then think of to enumerate the final jump is the point, but since no time
answer
T1 'interval dp "
T2 "greedy"
Correct greedy: remove the last jump before our choices must be AB descending order
The last enumeration that time, the complexity of the $ (n ^ 2) O $
Then add a fake greedy: enumerate only the first 100 largest A, then it is not the card. . . (escape
547 increasingly decadent, has been unable to write a good blog