POJ 3422 Kaka's Matrix Travels Around the matrix: Each cell has, the score can only be obtained once the N * N map. Some people start from the upper left, or right to move one space at a time, until the bottom right, count as one around. After asking around the maximum cumulative score of K-th? The minimum cost flow by means of critical flow 3.5 to solve the problem of network flow is how to deal with "can only get a" problem, for which you can create a pseudo point for each point, the two sides have linked to. Pseudo even to the point of origin a capacity of 1, the right side is negative fraction; original point connected to a capacity of the dummy point is infinite, the right side is zero. The former represents only take a fraction, which represents the second sequence three times ...... can ...
Continue reading : yard farm >> POJ 3422 Kaka's the Matrix Travels problem solution "Challenge Programming Contest"
Original link : http://www.hankcs.com/program/algorithm/poj-3422-kakas-matrix-travels.html
Reproduced in: https: //my.oschina.net/hankcs/blog/375885