[Dynamic Programming] happy Jinming

Original title Portal

Thinking

Yes, it's me, I've come to the water backpack ~ ~ ~ ~ ~ ~ escape

Refer to my other blog post: [Valley] Los herbs

状态转移方程为：
dp[i][j]=dp[i-1][j] (j<w[i])
dp[i][j]=max{dp[i-1][j],dp[i-1][j-w[i]]+v[i]*w[i]} (j≥w[i])

Then, put the code on a theme slightly modified (3min), you can water over this question.

Code

//经典背包，无需解释 
#include<iostream>
#include<cstdio>
#include<cmath>

using namespace std;

int T,M,w[26],v[26],dp[26][30001];

int main()
{
    //初始化 
    for(int i=1;i<=M;i++)
    {
        dp[i][0]=0;
    }
    for(int i=1;i<=T;i++)
    {
        dp[0][i]=0;
    }
    
    //读入 
    scanf("%d%d",&T,&M);
    for(int i=1;i<=M;i++)
    {
        scanf("%d%d",&w[i],&v[i]);
    }
    
    //装叉走起
    for(int i=1;i<=M;i++)
    {
        for(int j=1;j<=T;j++)
        {
            if(j<w[i])
            {
                dp[i][j]=dp[i-1][j];
            }
            else
            {
                dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+w[i]*v[i]);
            }
        } 
    }
    
    //输出
    printf("%d",dp[M][T]);
    
    return 0;
}

Reproduced in: https: //www.cnblogs.com/gongdakai/p/11031465.html