POJ 3735 Training little cats tuning cat: n-hungry only cat, a conventional set of Play shame, the operation consisting of k, all selected:. 1 gi i cats to a peanut 2. ei allows only the i after the cat ate it peanuts 3. sij for cat cat i and j are the one group of peanuts exchange Play now made m times, each seeking the number of peanuts cat? 3.4 master power of dynamic programming matrix and how these three difficulties in operation is converted to a matrix operation, the test data on the subject, for example, peanut cat definition represents a vector A: 1 0 0 0A [id] denotes id cats peanut initial number ...
Continue reading : yard farm >> POJ 3735 Training Little CATS problem solution "Challenge Programming Contest"
Original link : http://www.hankcs.com/program/algorithm/poj-3735-training-little-cats-time.html
Reproduced in: https: //my.oschina.net/hankcs/blog/355606