【P1048 采药】 01背包/记忆化搜索

P1048
这道题能写 01 背包和记忆化搜索
本着练习一下记忆化搜索的目的 写了一发记忆化搜索
dp[i][j]代表到第i个东西 剩余容量为j 取得的草药数
首先将dp数组初始化为 -1 然后用以记忆化
因为我们不借助外部参数 val 来返回答案 所以我们是可以记忆化的(对于相同i j 值相同

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)