Min cost Max Flow

Revision en2, by uttom, 2017-05-20 19:16:37

Problem Link:Here ~~~~~ I have already solved this problem using Dp. But in Tag I have seen that it can be solved with Min cost Max flow. Give some Hints how can i solve this problem using Min cost Max flow. Thanks in Adavance ~~~~~

Tags min cost max flow

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English uttom 2017-05-20 19:18:07 4 Tiny change: 'em=1071)\n~~~~~\n\nI have a' -> 'em=1071)\n\n~~~~~\nI have a'
en2 English uttom 2017-05-20 19:16:37 10
en1 English uttom 2017-05-20 19:15:45 319 Initial revision (published)