空间优化代码:#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
int n,V;
int v[1004],w[1003];
int dp[1004][1004];
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t;
cin>>t;
while(t--)
{
cin>>n>>V;
for(int i=1;i<=n;i++)
cin>>w[i];
for(int j=1;j<=n;j++)
cin>>v[j];
cle(dp);
///dp[i][j]=max(dp[i-1][j],dp[i][j-v[i]]+w[i]);
for(int i=1;i<=n;i++)
{
for(int j=0;j<v[i];j++)
dp[i][j]=dp[i-1][j];
for(int j=v[i];j<=V;j++)
dp[i][j]=max(dp[i-1][j],dp[i-1][j-v[i]]+w[i]);
}
cout<<dp[n][V]<<endl;
}
return 0;
}
对于空间优化的代码可以理解为,空一次遍历,这样才能使dp[j-v[i]]等价于dp[i-1][j-v[i]]。看图#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t;cin>>t;
int n,v;int value[1002],vol[1002];int dp[1002];
while(t--)
{ cle(dp);
cin>>n>>v;
for(int i=1;i<=n;i++)
cin>>value[i];
for(int i=1;i<=n;i++)
cin>>vol[i];
for(int j=1;j<=n;j++)
for(int k=v;k>=vol[j];k--)
dp[k]=max(dp[k],dp[k-vol[j]]+value[j]);
cout<<dp[v]<<endl;
}
return 0;
}