文件名称:maxm
介绍说明－－下载内容均来自于网络，请自行研究使用
给定由n 个整数(可能为负整数)组成的序列1 a ， 2 a ，…， n a ，以及一个正整数m，要
求确定序列1 a ， 2 a ，…， n a 的m 个不相交子段，使这m 个子段的总和达到最大。-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.
求确定序列1 a ， 2 a ，…， n a 的m 个不相交子段，使这m 个子段的总和达到最大。-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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
maxm.cpp