Description: given by n integers (with the possible negative integers) consisting of a sequence of 1, a 2, ..., n a, and a positive integer m, a request to determine a sequence, a 2, ..., n m of a non-intersection, so that the m height of the sum of the maximum.
To Search:
File list (Check if you may need any files):