4 ms·
It's probably easier to come up with the reduction to maximum bipartite matching than to come up with a working greedy algorithm for bishops.
by anonymoushn 10y ago
It's probably easier to come up with the reduction to maximum bipartite matching than to come up with a working greedy algorithm for bishops.