POJ 3046 Ant Counting——多重集组合数+滚动数组

Description

Bessie was poking around the ant hill one day watching the ants march to and fro while gathering food. She realized that many of the ants were siblings, indistinguishable from one another. She also realized the sometimes only one ant would go for food, sometimes a few, and sometimes all of them. This made for a large number of different sets of ants!

Being a bit mathematical, Bessie started wondering. Bessie noted that the hive has T (1 <= T <= 1,000) families of ants which she labeled 1…T (A ants altogether). Each family had some number Ni (1 <= Ni <= 100) of ants.

How many groups of sizes S, S+1, …, B (1 <= S <= B <= A) can be formed?

While observing one group, the set of three ant families was seen as {1, 1, 2, 2, 3}, though rarely in that order. The possible sets of marching ants were:

3 sets with 1 ant: {1} {2} {3}
5 sets with 2 ants: {1,1} {1,2} {1,3} {2,2} {2,3}
5 sets with 3 ants: {1,1,2} {1,1,3} {1,2,2} {1,2,3} {2,2,3}
3 sets with 4 ants: {1,2,2,3} {1,1,2,2} {1,1,2,3}
1 set with 5 ants: {1,1,2,2,3}

Your job is to count the number of possible sets of ants given the data above.

Input

• Line 1: 4 space-separated integers: T, A, S, and B

• Lines 2…A+1: Each line contains a single integer that is an ant type present in the hive

Output

• Line 1: The number of sets of size S…B (inclusive) that can be created. A set like {1,2} is the same as the set {2,1} and should not be double-counted. Print only the LAST SIX DIGITS of this number, with no leading zeroes or spaces.

Sample Input

3 5 2 3
1
2
2
1
3

Sample Output

10
Hint

INPUT DETAILS:

Three types of ants (1…3); 5 ants altogether. How many sets of size 2 or size 3 can be made?

OUTPUT DETAILS:

5 sets of ants with two members; 5 more sets of ants with three members
题目大意：有T个family，里面成员标签都一样，一排蚂蚁里面有A只，问分组种有S只、S+1只…一直到B只总共有多少组？

题目分析

多重集组合数主要套公式就完事了，以下链接是公式的推导
多重集组合数公式推导

方法一：用最基础的多重集组合数（会超出内存）

//需要开 dp[1001][100000]对于这道题来说太大了
for(int i=0;i<=t;i++){
			dp[i][0]=1;
		}
		for(int i=0;i<t;i++){
			for(int j=1;j<=b;j++){
				if(j-1-fam[i]>=0){
					dp[i+1][j]=(dp[i+1][j-1]+dp[i][j]-dp[i][j-1-fam[i]]+M)%M;
				}else{
					dp[i+1][j]=(dp[i+1][j-1]+dp[i][j])%M;
				}
			}
		}
		int sum=0;
		for(int i=s;i<=b;i++){
			sum=(sum+dp[t][i])%M;
		} 

方法二：在前面基础上使用滚动数组（可以AC）

因为会发现实际上公式也只是用了这一次的和上一次的，所以我们可以使用滚动数组来最大程度减小空间使用。

dp[0][0]=dp[1][0]=1;
		for(int i=0;i<t;i++){
			for(int j=1;j<=b;j++){
				if(j-1-fam[i]>=0){
					dp[(i+1)&1][j]=(dp[(i+1)&1][j-1]+dp[i&1][j]-dp[i&1][j-1-fam[i]]+M)%M;
				}else{
					dp[(i+1)&1][j]=(dp[(i+1)&1][j-1]+dp[i&1][j])%M;
				}
			}
		}
		int sum=0;
		for(int i=s;i<=b;i++){
			sum=(sum+dp[t&1][i])%M;
		}
		printf("%d\n",sum);