EOJ 1494 Coins

http://www.acm.cs.ecnu.edu.cn/problem.php?problemid=1494

poj 1742 http://poj.org/problem?id=1742

这题是一个部分背包，本来想过用二分的方法变成一个0-1背包，时间复杂度为(nlogV*V)，但是还是超时了，所以要优化成(nV)的才能过

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <set>
using namespace std;
 
int dp[100005], cou[100005];
int n, m;
int a[105], b[105];

int k;
 
int main()
{
    while (cin >> n >> m)
    {
        for (int i = 0; i < n; i++)
            scanf("%d", &a[i]);
        for (int i = 0; i < n; i++)
            scanf("%d", &b[i]);
        memset(dp, 0, sizeof(dp));
        dp[0] = 1;    
        for (int i = 0; i < n; i++)
        {
            memset(cou, 0, sizeof(cou));
            for (int j = a[i]; j <= m; j++)
                if (dp[j - a[i]] && !dp[j] && cou[j - a[i]] < b[i])
                {
                    cou[j] = cou[j - a[i]] + 1;
                    dp[j] = 1;
                }
        }
        int cnt = 0;
        for (int i = 1; i <= m; i++)
            if (dp[i])
                cnt++;
        cout << cnt << endl;    
    }
    return 0;
}