现在的位置: 首页 > 算法 > 正文

poj 1276 背包啊

2019年02月28日 算法 ⁄ 共 2306字 ⁄ 字号 评论关闭
Cash Machine
Time Limit:?1000MS ? Memory Limit:?10000K
Total Submissions:?22011 ? Accepted:?7723

秒速赛车公式 www.l19l7.cn Description

A Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say Dk, k=1,N, and for each denomination Dk the machine has a supply
of nk bills. For example,?

N=3, n1=10, D1=100, n2=4, D2=50, n3=5, D3=10?

means the machine has a supply of 10 bills of @100 each, 4 bills of @50 each, and 5 bills of @10 each.?

Call cash the requested amount of cash the machine should deliver and write a program that computes the maximum amount of cash less than or equal to cash that can be effectively delivered according to the available bill supply of the machine.?

Notes:?
@ is the symbol of the currency delivered by the machine. For instance, @ may stand for dollar, euro, pound etc.?

Input

The program input is from standard input. Each data set in the input stands for a particular transaction and has the format:?

cash N n1 D1 n2 D2 ... nN DN?

where 0 <= cash <= 100000 is the amount of cash requested, 0 <=N <= 10 is the number of bill denominations and 0 <= nk <= 1000 is the number of available bills for the Dk denomination, 1 <= Dk <= 1000, k=1,N. White spaces can occur freely between the numbers
in the input. The input data are correct.?

Output

For each set of data the program prints the result to the standard output on a separate line as shown in the examples below.?

Sample Input

735 3  4 125  6 5  3 350
633 4  500 30  6 100  1 5  0 1
735 0
0 3  10 100  10 50  10 10

Sample Output

735
630
0
0

Hint

The first data set designates a transaction where the amount of cash requested is @735. The machine contains 3 bill denominations: 4 bills of @125, 6 bills of @5, and 3 bills of @350. The machine can deliver the exact amount of requested cash.?

In the second case the bill supply of the machine does not fit the exact amount of cash requested. The maximum cash that can be delivered is @630. Notice that there can be several possibilities to combine the bills in the machine for matching the delivered
cash.?

In the third case the machine is empty and no cash is delivered. In the fourth case the amount of cash requested is @0 and, therefore, the machine delivers no cash.

Source

背包问题啊,可以看作01背包啊,不过会超时啊,这里要加上个记数的数组正序来就可以了
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int cash,f[100005],n,m,a,c[100005];
int main()
{
    while(scanf("%d",&cash)!=EOF)
    {
        memset(f,0,4*(cash+1));//人工计算位
        scanf("%d",&n);
        for(int i=0;i<n;i++)
        {
            scanf("%d%d",&m,&a);
            memset(c,0,4*(cash+1));
            for(int j=a;j<=cash;j++)
            {
                if(f[j-a]+a>f[j]&&c[j-a]<m)
                {
                    f[j]=f[j-a]+a;
                    c[j]=c[j-a]+1;
                }
            }
        }
        cout<<f[cash]<<endl;
    }
    return 0;
}

抱歉!评论已关闭.

  • 新疆各族群众体验端午传统文化 2019-05-25
  • 【十九大·理论新视野】动漫:“社会主义现代化强国”如何建成 2019-05-25
  • 太原黑臭水体治理接受国家专项督查 2019-05-24
  • 白芦笋:一年一会矜贵食 2019-05-24
  • 安徽通报2018年上半年全省旅游投诉情况 2019-05-24
  • 女性之声——全国妇联 2019-05-23
  • 【新华微视评】偏远农村的“智慧消防” 2019-05-23
  • 万花瞳:万花迷人眼 慧瞳观天下 2019-05-23
  • 视频:热心球迷!陈奕迅吴秀波惊现世界杯开幕式现场 2019-05-22
  • 【北京神龙京津车型报价】北京神龙京津4S店车型价格 2019-05-22
  • 国外看中国科技:中国隧道技术发展迅速享誉世界 2019-05-22
  • 孕妇在巴黎大区快线列车上产子 宝宝获赠“大礼” 2019-05-22
  • 【学习时刻】中国人民大学副校长刘元春:中央经济工作会议的四大亮点 2019-05-21
  • 环球佳酿举行新品发布会 百余款酒品集中发售 2019-05-21
  • 改造后的老旧楼房抗震能力是否提高?新老建筑是否共用逃生通道? 2019-05-21
  • 244| 621| 349| 586| 12| 126| 181| 968| 424| 616|