zoukankan      html  css  js  c++  java
  • Codeforces 189 A. Cut Ribbon(DP 恰装满的完全背包问题)

    题目链接

    Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions:

    • After the cutting each ribbon piece should have length a, b or c.
    • After the cutting the number of ribbon pieces should be maximum.

    Help Polycarpus and find the number of ribbon pieces after the required cutting.

    Input

    The first line contains four space-separated integers n, a, b and c (1 ≤ n, a, b, c ≤ 4000) — the length of the original ribbon and the acceptable lengths of the ribbon pieces after the cutting, correspondingly. The numbers a, b and c can coincide.

    Output

    Print a single number — the maximum possible number of ribbon pieces. It is guaranteed that at least one correct ribbon cutting exists.

    Examples

    input

    5 5 3 2
    

    output

    2
    

    input

    7 5 5 2
    

    output

    2
    

    题意:一块长为n的布,现在要把它剪开,只能剪成a, b, c这样的小块布,求最多能剪成多少块。。。

    分析:就是一个需要刚好装满的完全背包问题,只有三种商品a, b, c,能取无限件物品,每件物品价值是1,求最大价值

    #include<bits/stdc++.h>
    using namespace std;
    const int inf = 1e9 + 7;
    int n, a[3], dp[4010] = { 0 };
    int main() {
        cin >> n >> a[0] >> a[1] >> a[2]; dp[0] = 0;
        for (int i = 1; i <= n; ++i) dp[i] = -inf;
        for (int i = 1; i <= n; ++i)
            for (int j = 0; j < 3; j++){
                if (i >= a[j]) dp[i] = max(dp[i], dp[i - a[j]] + 1);
            }
        cout << dp[n];
        return 0;
    }
    
  • 相关阅读:
    Arduino系列之智能家居蓝牙语音遥控灯(四)
    Arduino系列之光照传感器(三)
    address2line 定位 Android c++奔溃位置
    android UI线程安全问题
    android 后台服务定时通知
    eclipse 完全智能提示
    IOS 7 Xcode 5 免IDP证书 真机调试(转载)
    DS5 调试 android c++
    javap -s 查看java方法签名
    ndk-stack 调试 android c++ 代码崩溃位置
  • 原文地址:https://www.cnblogs.com/RioTian/p/13355236.html
Copyright © 2011-2022 走看看