多重部分和问题

<pre name="code" class="cpp"><span style="font-size:14px;">//multisum_001.cpp -- 多重部分和
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
typedef long long ll;
using namespace std;
const int maxN = 100 + 10;
const int maxK = 100000 + 10;
int N, K, v[maxN], n[maxN];
int dp[maxK];
void solve()
{
	/*
					n[i];	(dp[i-1][j]>=0)	ps:>=	想想为什么？
		dp[i][j] = 	-1;		(j<w[i] || dp[i][j-a[i]]<=0)	ps:<=
					dp[i][j-w[i]] - 1;	(else)
	*/
	memset(dp, -1, sizeof(dp));		// 初始化为-1表示无法得到这个值
	dp[0] = 0;
	for( int i=1; i<=N; i++ )
	{
		for( int j=0; j<=K; j++ )
		{
			if( dp[j]>=0 )
				dp[j] = n[i];
			else if( j<v[i] || dp[j-v[i]]<=0 )
				dp[j] = -1;
			else
				dp[j] = dp[j-v[i]] -1;
		}
	}
	int cnt = 0;
	for( int i=1; i<=K; i++ )
		if( dp[i]>=0 )
			cnt++;
	cout<<cnt<<endl;
}
int main()
{
	while( cin>>N>>K && N )
	{
		for( int i=1; i<=N; i++ )
			cin>>v[i];
		for( int i=1; i<=N; i++ )
			cin>>n[i];
		solve();
	}
	return 0;
}</span>