A Bipartite Matching Problem (UVa 11419 — SAM I AM)

Правка en1, от flash_7, 2015-10-04 20:20:54

I'm stuck with this problem and can't figure out how to proceed.Can anyone give me some hints how can i solve it using BPM?

Теги graph, bipartite matching, max flow

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский flash_7 2015-10-04 20:20:54 290 Initial revision (published)