wonderful_trip's blog

By wonderful_trip, history, 23 months ago, In English

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 !!!

  • Vote: I like it
  • +11
  • Vote: I do not like it

»
23 months ago, # |
  Vote: I like it +4 Vote: I do not like it

Seems the problem is about maximum bipartite matching.