dp

hdu 2602
滚动数组

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
int dp[1011];
int t,v,n;
struct node{
    int val;
    int vol;
}bone[1011];
int solve(){
    memset(dp,0,sizeof(dp));
    for(int i=1;i<=n;i++){
        for(int j=v;j>=bone[i].vol;j--){
            dp[j]=max(dp[j],dp[j-bone[i].vol]+bone[i].val);
        }
    }
    return dp[v];
}
int main()
{
   cin>>t;
   while(t--){
       cin>>n>>v;
       for(int i=1;i<=n;i++) cin>>bone[i].val;
       for(int i=1;i<=n;i++) cin>>bone[i].vol;
       cout<<solve()<<endl;
   }
    return 0;
}

dp

#include <bits/stdc++.h>
#include <algorithm>
#include<cmath>
using namespace std;
#define js ios::sync_with_stdio(false);cin.tie(0); cout.tie(0)
typedef long long ll;
const ll MOD = 1e5 + 7;
const ll maxn =2e6+7;
inline ll read() { ll s = 0, w = 1; char ch = getchar(); while (ch < 48 || ch > 57) { if (ch == '-') w = -1; ch = getchar(); }    while (ch >= 48 && ch <= 57) s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar(); return s * w; }
inline void write(ll x) { if (!x) { putchar('0'); return; } char F[200]; ll tmp = x > 0 ? x : -x; if (x < 0)putchar('-'); int cnt = 0;    while (tmp > 0) { F[cnt++] = tmp % 10 + '0';     tmp /= 10; }    while (cnt > 0)putchar(F[--cnt]); }
inline ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll qpow(ll a, ll b) { ll ans = 1;   while (b) { if (b & 1)  ans *= a;       b >>= 1;      a *= a; }   return ans; }   ll qpow(ll a, ll b, ll mod) { ll ans = 1; while (b) { if (b & 1)(ans *= a) %= mod; b >>= 1; (a *= a) %= mod; }return ans % mod; }
inline int lowbit(int x) { return x & (-x); }
struct node{
    int val;
    int vol;
}bone[1011];
int t,n,v;
int dp[1011][1011];
int solve(){
    for(int i=1;i<=n;i++){
        for(int j=0;j<=v;j++){
            if(bone[i].vol>j)
            dp[i][j]=dp[i-1][j];//第i个物品太大
            else dp[i][j]=max(dp[i-1][j],dp[i-1][j-bone[i].vol]+bone[i].val);
        }
    }
    return dp[n][v];
}
int main(){
   cin>>t;
   while(t--){
       cin>>n>>v;
       for(int i=1;i<=n;i++) cin>>bone[i].val;
       for(int i=1;i<=n;i++) cin>>bone[i].vol;
       cout<<solve()<<endl;
   }
}