排列问题

M个1,N个0的排列(高效率版)

排列数为:c(m+n,n)

对n个0,m个1,我的想法是这样的:

每个排列可以分三段:

全0列,全1列, 子问题列

设各段长:r,s,t .子问题列就是 (n,m) = (n-r,m-s),其中0<=r<=n,s=1-problem with M-1, N 0 is the order (high-efficiency version) with a few : c (m n, n) of n 0, m one, I think is this : each can be arranged IPP : 0 whole, a whole, the sub - problems out of the long established : r, s, t. - is the question of (n, m) = (n-r, m-s), where 0