int calc(int i,int k) { int ret=F[i]; ret-=k*d[i]; return ret; } void dp() { int ans=0; f[0][1][0]=0; for(int i=0;i<=h;i++) for(int j=1;j<=n;j++) for(int k=0;k<=h;k++) { if(i==0&&j==1&&k==0) continue; f[i][j][k]=-100000000; } for(int i=0;i<=h;i++) for(int j=1;j<=n;j++) for(int k=0;k<=h;k++) { int p=calc(j,k); if(i+1<=h && k+1<=h) { f[i+1][j][k+1]=max(f[i][j][k]+p,f[i+1][j][k+1]); } if(i+t[j+1]<=h && j+1<=n) { f[i+t[j+1]][j+1][0]=max(f[i+t[j+1]][j+1][0],f[i][j][k]); } ans=max(ans,f[i][j][k]); } cout<<ans; }