zoukankan      html  css  js  c++  java
  • H

    题目链接:http://acm.hust.edu.cn/vjudge/contest/126708#problem/H

    题目大意:无敌背包问题。。每个物品个数都给出来了,这就比较难搞了,,目前未找到完美的代码,所以就不误导大家了

    仅供大家参考

    代码如下:

    #include<stdio.h>
    #include<string.h>
    int main()
    {
        int n,m,a[500],b[500],i,j,k,vis[100005],use[100005];;
        while(scanf("%d%d",&n,&m)==2)
        {
            if(n==0&&m==0)break;
            for(i=0;i<n;i++)
                scanf("%d",&a[i]);
            for(i=0;i<n;i++)
                scanf("%d",&b[i]);
            memset(vis,0,sizeof(vis));
            vis[0]=1;int ans=0;
            for(i=0;i<n;i++)
            {
                memset(use,0,sizeof(use));
                for(j=a[i];j<=m;j++)
                {
                    if(vis[j]==0&&vis[j-a[i]]&&use[j-a[i]]<b[i])
                    {
                        use[j]=use[j-a[i]]+1;
                        vis[j]=1;
                        ans++;
                    }
                }
            }
            printf("%d ",ans);
        }
    }

  • 相关阅读:
    [CF1342D] Multiple Testcases
    [CF448D] Multiplication Table
    [CF459C] Pashmak and Buses
    [CF766E] Mahmoud and a xor trip
    [CF35E] Parade
    [CF15C] Industrial Nim
    [CF9D] How many trees?
    [CF19B] Checkout Assistant
    [CF22D] Segments
    [CF21D] Traveling Graph
  • 原文地址:https://www.cnblogs.com/441179572qqcom/p/5767339.html
Copyright © 2011-2022 走看看