Обсуждение @ 1076. Trash @ Timus Online Judge

I have problems here ... Is this Maximum Weighted Matching ?! I solve it with this approach but I won't make code for Maximum Weighted Matching, I suppose it has simpler solution ... Need an answer ?

Послано Dejan Kolundzija 10 янв 2002 19:35

Yes, this is a Maximum(Minimum) Weighted Matching on biparty graph.

Послано Andrey Popyk (popyk@ief.tup.km.ua) 10 янв 2002 19:51

Re: Yes, this is a Maximum(Minimum) Weighted Matching on biparty graph.

Послано Dejan Kolundzija 12 янв 2002 06:02

Thanx!
But I know one monster implementation that I don't like to code. If
you have some other (easier) I'd rather want to know. Please send any
useful information to sidejan@yahoo.com . Thanx!

Обсуждение задачи 1076. Trash