DP problem..

Revision en1, by its_ulure, 2018-06-09 10:23:57

I came across a problem few days ago. The problem states that given a set of n numbers , we need to divide the set into k groups (where, 1<=k<n)) such that the maximum product(of the numbers) in all the possible groups is minimal. Thanks in advance :)

Tags #dynamic-programming

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English its_ulure 2018-06-09 11:50:12 0 (published)
en1 English its_ulure 2018-06-09 10:23:57 264 Initial revision (saved to drafts)