Databases
StackOverflow2013
Postsdbo
POMaximize sum of table where each number must come from unique row and column
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POMaximize sum of table where each number must come from unique row and column
    primarykey
    data
    text
    <p>Suppose we have a table of numbers like this (we can assume it is a square table):</p> <pre><code>20 2 1 3 4 5 1 14 8 9 15 12 17 17 11 16 1 1 15 18 20 13 15 5 11 </code></pre> <p>Your job is to calculate the maximum sum of n numbers where n is the number of rows or columns in the table. The catch is <strong>each number must come from a unique row and column.</strong> </p> <p>For example, selecting the numbers at (0,0), (1,1), (2,2), (3,3), and (4,4) is acceptable, but (0,0), (0,1), (2,2), (3,3), and (4,4) is not because the first two numbers were pulled from the same row.</p> <p>My (laughable) solution to this problem is iterating through all the possible permutations of the rows and columns. This works for small grids but, of course, it is incredibly slow as n gets big. It has O(n!) time complexity, if I'm not mistaken (sample Python code below).</p> <p>I really think this can be solved in better time, but I'm not coming up with anything sufficiently clever.</p> <p>So my question is, what algorithm should be used to solve this?</p> <p>If it helps, this problem <em>seems</em> similar to the <a href="http://en.wikipedia.org/wiki/List_of_knapsack_problems">knapsack problem</a>.</p> <pre><code>import itertools import re grid = """20 2 1 3 4 5 1 14 8 9 15 12 17 17 11 16 1 1 15 18 20 13 15 5 11""" grid = [[int(x) for x in re.split("\s+", line)] for line in grid.split("\n")] possible_column_indexes = itertools.permutations(range(len(grid))) max_sum = 0 max_positions = [] for column_indexes in possible_column_indexes: current_sum = 0 current_positions = [] for row, col in enumerate(column_indexes): current_sum += grid[row][col] current_positions.append("(%d, %d)" % (row, col)) if current_sum &gt; max_sum: max_sum = current_sum max_positions = current_positions print "Max sum is", max_sum for position in max_positions: print position </code></pre>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. This table or related slice is empty.
    1. USMatt
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POMaximize sum of table where each number must come from unique row and column
      1. USKaroly Horvath
      1. VTFavorite
    2. VO
      singulars
      1. POMaximize sum of table where each number must come from unique row and column
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POMaximize sum of table where each number must come from unique row and column
      1. USAndriy Tylychko
      1. VTFavorite
    1. COOut of curiosity, where did you come across this problem?
      singulars
      1. POMaximize sum of table where each number must come from unique row and column
      1. USNemo
    2. COIt comes up on a challenge on codeeval.com. I won't say which though!
      singulars
      1. POMaximize sum of table where each number must come from unique row and column
      1. USMatt
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload