hdu 2152 Fruit
2013-08-11 10:41
134 查看
母函数
#include<stdio.h> #include<string.h> int c1[200],c2[200]; int a[200],b[200]; int main() { int i,j,k,n,m; while(scanf("%d %d",&n,&m)!=EOF) { for(i=0;i<n;i++) scanf("%d %d",&a[i],&b[i]); memset(c1,0,sizeof(c1)); memset(c2,0,sizeof(c2)); for(i=a[0];i<=b[0];i++) c1[i]=1; for(i=2;i<=n;i++) { for(j=0;j<=m;j++) for(k=a[i-1];k+j<=m&&k<=b[i-1];k++) c2[j+k]+=c1[j]; for(j=0;j<=m;j++) { c1[j]=c2[j]; c2[j]=0; } } printf("%d\n",c1[m]); } return 0; }
相关文章推荐
- HDU 2152 Fruit
- hdu 3480 斜率dp
- HDU Counting Sheep
- HDU 3347:Calculate the expression
- 【树状数组+三维】杭电 hdu 3584 Cube
- Hdu 1102 Constructing Roads
- hdu 3068 最长回文
- HDU-2024c语言合法标识符
- hdu 4419 Colourful Rectangle (离散化扫描线线段树)
- hdu 4647 Another Graph Game 博弈
- hdu 4712 Hamming Distance bfs
- HDU 3038 How Many Answers Are Wrong
- hdu 1075 字典树 和 map做法
- hdu 2093 考试排名(sscanf)
- HDU 1732——Push Box(BFS)
- HDU 1698 Just a Hook (线段树区间更新)
- hdu_4027Can you answer these queries?线段树+区间更新
- HDU Count the string 【dp KMP】(求子串总数)
- hdu 4910 String && BestCoder Round #3
- HDU 1285 确定比赛名次