模板:
//初始化a,因为有last,所以这里无需初始化其他位
a[0]=1;
int last=0;
for (int i=0;i<K;i++)
{
int last2=min(last+n[i]*v[i],P);//计算下一次的last
memset(b,0,sizeof(int)*(last2+1));//只清空b[0..last2]
for (int j=n1[i];j<=n2[i]&&j*v[i]<=last2;j++)//这里是last2
for (int k=0;k<=last&&k+j*v[i]<=last2;k++)//这里一个是last,一个是last2
b[k+j*v[i]]+=a[k];
memcpy(a,b,sizeof(int)*(last2+1));//b赋值给a,只赋值0..last2
last=last2;//更新last
}
hdu 2082:
#include <iostream>
#include <cstring>
using namespace std;
#define min(a,b) ((a)<(b)?(a):(b))
int N,n[26],v[26],a[51],b[51],i,j,k,last,last2,sum;
int main()
{
cin>>N;
while ((N--)!=0)
{
for (i=0;i<26;i++)
{
cin>>n[i];
v[i]=i+1;
}
a[0]=1;
last=0;
for (i=0;i<26;i++)
{
last2=min(last+n[i]*v[i],50);
memset(b,0,sizeof(int)*(last2+1));
for (j=0;j<=n[i]&&j*v[i]<=last2;j++)
for (k=0;k<=last&&k+j*v[i]<=last2;k++)//当无数个选择时可去掉k<=last 有最小选择时应增加一个数组n1[i] k=n1[i]
b[k+j*v[i]]+=a[k];
memcpy(a,b,sizeof(int)*(last2+1));
last=last2;
}
sum=0;
for (i=1;i<=50;i++)
if (a[i]) sum+=a[i];
cout<<sum<<endl;
}
return 0;
}