HDU1011 tree-DP
2013-09-21
0 0 0
no vote
Other
Earn points
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.c++
HDU
DP
Related Source Codes
Local Path Planning Algorithm - DWA Algorithm
0
0
no vote
enDAQ-Shock-Data-Share-SRS-Blog
0
0
no vote
Calling chatGPT in a Windows application
0
0
no vote
Test Hello world
0
0
no vote
RCS calculation by one-way ray tracing
0
0
no vote
No comment