[poj2396] buget[feasible flow of upper and lower bounds]

Test instructions: There is a n*m square, inside the number is unknown, but we know the following constraints: The number of each row and the number of each column and some lattice has a special size constraints, with greater than, less than and equal to the number of questions: whether there is a positive number to fill the square of the scheme, to meet all constraints, if any, the output , otherwise the output impossible. is to first establish a graph, the source point to each row of the edge of the capacity of the upper and lower bounds for the row and, each column to the meeting point a capacity up and down bounded by the edge of the columns, each row of points to each column of the point of a capacity up and down bounded by the row and the column represents the upper and lower bounds.

[poj2396] buget[feasible flow of upper and lower bounds]