bzoj1630 [Usaco2007 Demo]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. //有三个家庭的ANT，共五只，分别编号为1,2,2,1,3，现在将其分为2个集合及3集合，有多少种分法

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

INPUT DETAILS:

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

Sample Output

OUTPUT DETAILS:

5 sets of ants with two members; 5 more sets of ants with three members

一道背包dp、令f[i][j]表示前i个数字凑出j个集合的方案数

那么

f[i][j]=∑f[i−1][j−k]|a[i]k=0

（看这公式多高端）

然后空间上10e的效率果断用滚动数组

时间上用前缀和搞一下

#include<cstdio>

#define mod 1000000

#define MAX 100010

inline int read()

{

    int x=0,f=1;char ch=getchar();

    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}

    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}

    return x*f;

}

int n,m,x,t1,t2,cur,pre,ans;

int rep[MAX],s[MAX],sum[MAX];

int f[2][MAX];

int main()

{

    n=read();m=read();t1=read();t2=read();

    for (int i=1;i<=m;i++)

    {

        x=read();

        rep[x]++;

    }

    for(int i=1;i<=n;i++)s[i]=s[i-1]+rep[i];

    f[0][0]=1;cur=1;pre=0;

    for (int i=1;i<=n;i++)

      {

        pre^=1;cur^=1;

        sum[0]=f[cur][0];

        for (int j=1;j<=s[i];j++)

          sum[j]=(sum[j-1]+f[cur][j])%mod;

        for (int j=0;j<=s[i];j++)

          if (j<=rep[i]) f[pre][j]=sum[j]%mod;

          else f[pre][j]=(sum[j]-sum[j-rep[i]-1])%mod;

      }

    for (int i=t1;i<=t2;i++)

      ans=(ans+f[pre][i])%mod;

    printf("%d",ans);

}