POJ3046 Ant Counting DP 隔板法讲解 有图有真相

POJ 3046  Ant Counting

描述

---

n种蚂蚁,第i种有ai个,不同种类的蚂蚁可以相互区分,但同一种类的蚂蚁不能相互区分,从这些蚂蚁中取出s,s+1,s+2,...,b-1,b个,问每种取的方式的取法数之和.

原型:多重集组合数:

n种物品,第i种有ai个.不同种类的物品可以相互区分,但同一种类的物品不能相互区分.从这些物品中取出m个,有多少种取法?

Ant Counting

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4358		Accepted: 1689

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

Source

USACO 2005 November Silver

和noip2012普及组 摆花 两道题是类似的，题目大意几乎相同。

该怎么做呢？ 用dp[i][j]表示在前i种物品中取出j个的组合数.(感谢Mu437的ppt和例题从零开始的异世界化学)

、
那么我们可以得到一个O（n*m*m）的方程

过第一题够了，但是还不够优秀，我们可以得到以下两个方程，显然①式比②式多了一个f[i][j-1]

那么f[i][j]=f[i][j-1]+f[i-1][j-1];

对于二题我们改一下就就可以了

if(j-1-a[i])>=0 dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1-a[i]];

else dp[i][j]=dp[i-1][j]+dp[i][j-1];

要用滚动数组的。

代码我就不发啦