排列约束条件下的快速生成算法

The Fast Generating Algorithm under Constrained Arrangement

所述的约束排列是指:m个非负整数所构成的排列a1a2...am,满足约束条件a1≤N1,a2≤N2,...,am≤Nm及a1+a2+...am=M,其中M和N1,N2,...Nm是给定的正整数。在此解决对于给定的一个约束排列a1a2...am,按照字典排序给出下一个约束排列的生成算法,并对查找位置的确定给出新思路。

A specific constrained arrangement will be discussed as followed： There is an arrangement with m nonnegative integers, which subjects to and . Both and are positive numbers. Under the constrained condition, this article finds out a generating algorithm and brings out a new method in locating.