No self-introduction
Loading
Profile
Follow
codes (2)
HDU1010 maze
no vote
POJ1010 maze of the source, search + pruning
Thought: because all the boys can escape only at fixed times reached their destination,
Cannot, nor delays, so can't use BFS . DFS can be used to identify all situations,
If there are feasible solutions, direct return can be. Beside the more depressing is that Admiral tzc
Array int dir[4][2] change slightly twice, it will timeout.
走不出de圈 1 0
1
HDU1011 tree-DP
no vote
A tree, there are n nodes, and each node v bug, w brain. I began to walk from the 1th, with m a soldier.
1 warrior can kill 20 bugs, if I destroy a nexus of all bug, I can get that brain of the nodes.
If you want to attack the current node, so you must attack its parent nexus (1th).
When you take the current node, you can assign a staff into several different sub nodes, to capture more. In other words, is not a single path.
走不出de圈 0 0
1
No more~
Follows0
Fans0