Min cost Max Flow

Правка en1, от uttom, 2017-05-20 19:15:45 
Problem Link:[Here](http://lightoj.com/volume_showproblem.php?problem=1071)

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
Теги min cost max flow

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский 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 Английский uttom 2017-05-20 19:16:37 10
en1 Английский uttom 2017-05-20 19:15:45 319 Initial revision (published)