you can do that with a binary search on the minimum edge weight combined with maximum matching in an arbitrary graph
can anyone provide us that arbitrary graph matching code?
I would accept PM too
Search found 3 matches
Search found 3 matches • Page 1 of 1
I realized that there are some algorithms which I get used to by solving problems instead of reading algorithm text books. like: ternary search, some query questions, method of dividing the problem into two equal sized problems( e.g : http://www.spoj.pl/problems/SUBSUMS ). I want to know the names o...
- Mon Feb 09, 2009 6:37 pm
- Forum: Volume 115 (11500-11599)
- Topic: 11553 - Grid Game
- Replies: 10
- Views: 3379
yes, it can be done using dp but before that i realized that BOB can take which number he wants from the board. so just choose the numbers with the minimum sum. it is enough to pass since i implemented it and passed in 0.030sec. BTW, i tried to solve it with DP too but get WA. i tried some test-case...