r*****e
发帖数: 146 | 1 Given n arrays, find n number such that sum of their differences is minimum.
For e.g. if there are three arrays
A = {4, 10, 15, 20}
B = {1, 13, 29}
C = {5, 14, 28}
find three numbers a, b, c such that |a-b| + |b-c| + |c-a| is minimum. Here
the answer is a = 15, b = 13, and c = 14.
It seems an old question. Any idea would be appreciated. Thanks! :) | c**s
发帖数: 159 | |
|
