Блог пользователя wonderful_trip

Автор wonderful_trip, история, 21 месяц назад, По-английски

I have 1 problem: There are n flower shops, the i-th shop sells ki different kinds of flowers. Need to buy n types of flowers from n given shops, each shop buys 1 type of flowers, so that n types of flowers after purchase are distinguished.

. n <= 2000 . ki <= 5

can someone help me with an idea to solve this problem.

thanks for help !!!

  • Проголосовать: нравится
  • +11
  • Проголосовать: не нравится

»
21 месяц назад, # |
  Проголосовать: нравится +4 Проголосовать: не нравится

Seems the problem is about maximum bipartite matching.