Buns---cf 106C（多重背包）

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <map>

using namespace std;

#define met(a, b) memset(a, b, sizeof(a))
#define INF 0x3f3f3f3f
#define N 210

int n, m, c
, d
, a
, b
, dp
[N*N];
int main()
{

while(scanf("%d %d %d %d", &n, &m, &c[1], &d[1])!=EOF)
{
met(dp, 0);
a[1] = 11000;
b[1] = 1;
for(int i=2; i<=m+1; i++)
{
scanf("%d %d %d %d", &a[i], &b[i], &c[i], &d[i]);
}
for(int i=1; i<=m+1; i++)
{
for(int k=0; k<=a[i]/b[i]; k++)
{
for(int j=n; j>=k*c[i]; j--)
{
dp[i][j] = max(dp[i][j], dp[i-1][j-k*c[i]]+k*d[i]);
}
}
}
printf("%d\n", dp[m+1]
);
}
return 0;
}