[{"title":"( 1 个子文件 12KB ) 动态规划划分最小和_把一个包含n个正整数的序列划分成m个连续的子序列,每个整数刚好属于一个序列。设-专业指导代码类资源","children":[{"title":"0","children":null,"spread":false},{"title":"970537.docx <span style='color:#111;'> 14.54KB </span>","children":null,"spread":false}],"spread":true}]