JOIN
Get Time
forums   
Search | Watch Thread  |  My Post History  |  My Watches  |  User Settings
View: Flat  | Threaded  | Tree
Previous Thread  |  Next Thread
Bipartite matching based problem | Reply
Hi,

I read the tutorial on Max Flows and stumbled across this bipartite matching based problem :
https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=697

I am stuck and can't see how max flow can be applied to solve this problem. Can someone please explain the logic for solution.

Thanks!
RSS