poj 1170 Shopping Offers 记忆化dfs

剪枝：当前状态已经存在了，它一定是最优值，直接返回它

View Code

#include <stdio.h>
#define inf 0x3f3f3f3f

struct node
{
int num[1000],price;
}ar[105];

int s,n,a[10],num[1000];
int dp[6][6][6][6][6];

int min(int x,int y)
{
return x<y?x:y;
}

int judge(int i)
{
int j;
for (j=0;j<n;j++)
    {
if(num[a[j]]<ar[i].num[a[j]])return 0;
    }
return 1;
}

int dfs()
{
int i,j,Min=inf;
if(dp[num[a[0]]][num[a[1]]][num[a[2]]][num[a[3]]][num[a[4]]]!=inf)
return dp[num[a[0]]][num[a[1]]][num[a[2]]][num[a[3]]][num[a[4]]];
for (i=0;i<s+n;i++)
    {
if(judge(i))
        {
for (j=0;j<n;j++)
            {
                num[a[j]]-=ar[i].num[a[j]];
            }
            Min=min(Min,dfs()+ar[i].price);
for (j=0;j<n;j++)
            {
                num[a[j]]+=ar[i].num[a[j]];
            }
        }
    }
return dp[num[a[0]]][num[a[1]]][num[a[2]]][num[a[3]]][num[a[4]]]=Min;
}

int main()
{
int i,j,k,b,price[1000],z,x,c,v,d;
    scanf("%d",&n);
for (i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
        scanf("%d%d",&num[a[i]],&price[a[i]]);
    }
    scanf("%d",&s);
for (i=0;i<s;i++)
    {
        scanf("%d",&k);
for (j=0;j<k;j++)
        {
            scanf("%d",&b);
            scanf("%d",&ar[i].num[b]);
        }
        scanf("%d",&ar[i].price);
    }
for (i=s,j=0;i<n+s;i++,j++)
    {
        ar[i].num[a[j]]=1;
        ar[i].price=price[a[j]];
    }
for(z=0;z<=5;z++)
for(x=0;x<=5;x++)
for(c=0;c<=5;c++)
for(v=0;v<=5;v++)
for(d=0;d<=5;d++)
                        dp[z][x][c][v][d]=inf;
    dp[0][0][0][0][0]=0;
    printf("%d\n",dfs());
return 0;
}

转载于:https://www.cnblogs.com/104-gogo/archive/2011/11/30/2269559.html