求助,玄学RE

P1507 NASA的食物计划

#include<cstdio> #include<iostream> using namespace std; int v,m; int n; int v_[55],m_[55],s_[55]; int f[100][100]; int i,j,k; int main() { scanf("%d%d%d",&v,&m,&n); for(i=1;i<=n;++i) scanf("%d%d%d",&v_[i],&m_[i],&s_[ i]); for(i=1;i<=n;++i) { for(j=v;j>=v_[i];--j) { for(k=m;k>=m_[i];--k) { f[j][k]=max(f[j][k],f[j-v_[i]][k-m_[i]]+s_[i]); } } } printf("%d",f[v][m]); return 0; }
by Flame丶 @ 2018-11-06 11:21:12


数组往大了开。。。 @[Flame丶](/space/show?uid=67499)
by E_tc @ 2019-04-27 20:50:24


希望更丰富的展现?[使用Markdown](https://www.luogu.com.cn/blog/luogu/how-to-use-markdown)
by CSPRPplusplus @ 2021-10-06 17:23:36


|