3 ms·
It's not really a maximum matching problem if a greedy algorithm works.
by conistonwater 10y ago
It's not really a maximum matching problem if a greedy algorithm works.
- anonymoushn 10y agoIt's probably easier to come up with the reduction to maximum bipartite matching than to come up with a working greedy algorithm for bishops.
- asrp 10y agoWhich greedy algorithm do you mean? I meant that bipartite matching was enough for getting the answer, not that the two are equivalent.
- anonymoushn 10y agoThere's a greedy algorithm explained at the bottom of this post: https://code.google.com/codejam/contest/3264486/dashboard#s=a&a=3 https://code.google.com/codejam/contest/3264486/dashboard#s=...