- Category:
- Data structs
- Tags:
-
[WORD]
- File Size:
- 4kb
- Update:
- 2012-11-26
- Downloads:
- 0 Times
- Uploaded by:
Description: Meaning of the questions: a-> bc: overcome b Castle before the first capture of a castle overcome b Castle will get c
The total n Castle (number-n) up to overcome the m castles can get maximum benefit
The root of the tree as a node connected into a tree
p [root] [i] i points to get selected in the sub-tree root-root maximum benefit
p [root] [i] = max (p [root] [i], p [root] [ij]+ p [v [e]] [j])
When the root! = 0 Meike subtree root Required so p [root] [i] = p [root] [i-1]+ val [root]
The result is p [0] [m]
To Search:
File list (Check if you may need any files):
hdu1561树形DP.doc
Download