Home > Back-end >  The great spirit how to solve this problems? I for 40 minutes
The great spirit how to solve this problems? I for 40 minutes

Time:09-21




In c and c + + is best,

CodePudding user response:

http://blog.csdn.net/wuyingzhiyi/article/details/44603369

CodePudding user response:

# 1 link of the algorithm is to calculate don't allow the supers,

CodePudding user response:

This split is integer problem (also called split), allow the aneroid is p (m, 1) + p (m, 2) +... + p (m, n), p (I, j) represents the I items in j box, each box at least put a number of methods,
  • Related