你这个差不多是164MB
by RiverFun @ 2018-09-08 17:42:59
@[Portland](/space/show?uid=121189) 滚动数组了解一下
by UKE自动稽 @ 2018-09-08 17:43:09
@[_UKE自动机_](/space/show?uid=71371) 滚动数组是什么鬼
by Portland @ 2018-09-08 17:47:34
@[Portland](/space/show?uid=121189)
难道你老师没教一维的背包吗？
```
f[j]=max(f[j],f[j-w[i]]+v[i]);
```
by UKE自动稽 @ 2018-09-08 17:51:20
@[_UKE自动机_](/space/show?uid=71371) 没教，但是我看了你的代码，就会了
by Portland @ 2018-09-08 17:53:24
谢谢 [[微笑](http://www.4399.com)]
by Portland @ 2018-09-08 17:54:48
```
#include<iostream>
#include<algorithm>
using namespace std;
int n,m;
struct aThs{
int h,p;
}a[3403];
int dp[12881]={0};
int main(){
int i,j;
cin>>n>>m;
for(i=1;i<=n;i++){
cin>>a[i].h>>a[i].p;
}
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
//cout<<i<<","<<j<<":";
if(a[i].h>j){
continue;
}
dp[j]=max(dp[j] , dp[j-a[i].h]+a[i].p);
//cout<<"dp "<<j<<" = "<<dp[j]<<endl;
//cout<<endl;
}
}
cout<<dp[m]<<endl;
return 0;
}
```
这个。。。你的这个是每样东西无限供应时才能用。。。QAQ
by Portland @ 2018-09-08 18:01:33
@[Portland](/space/show?uid=121189) 动态数组了解一下
by 7KByte @ 2018-09-08 18:07:44
~~动态数组又是什么鬼~~
by Portland @ 2018-09-08 18:09:07
@[online_wlq](/space/show?uid=119261)
by Portland @ 2018-09-08 18:09:24