- #1
Chuck37
- 52
- 0
I'd like to find a simple algorithm to do the following.
If I have an NxM matrix, with N≥M, find the M entries with the maximum product that do not share a row or column.
It doesn't seem hard, but I'm not seeing it right off.
If I have an NxM matrix, with N≥M, find the M entries with the maximum product that do not share a row or column.
It doesn't seem hard, but I'm not seeing it right off.