第三讲---DP问题（上课）

闫氏DP分析法(从集合角度分析)

1.背包问题

代码

#include<iostream>
#include<algorithm>

using namespace std;

const int N = 1010;
int n,m;//物品容量，背包体积
int v[N],w[N];//表示第 i 件物品的体积和价值
int f[N];//状态

int main()
{
    cin>>n>>m;
    
    for(int i = 1;i <= n;i++) cin>>v[i]>>w[i];
    
    


    for(int i = 1;i <= n;i++)
        for(int j = m;j >= v[i];j--)
        {
            
             f[j] = max(f[j],f[j - v[i]] + w[i]);
        }
    
    cout<<f[m]<<endl;
    
    return 0;
}

2.摘花生

代码

#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int N = 110;

int n, m;
int w[N][N];
int f[N][N];

int main()
{
    int T;
    cin >> T;
    while (T -- )
    {
        cin >> n >> m;
        for (int i = 1; i <= n; i ++ )
            for (int j = 1; j <= m; j ++ )
                cin >> w[i][j];

        memset(f, 0, sizeof f);
        for (int i = 1; i <= n; i ++ )
            for (int j = 1; j <= m; j ++ )
                f[i][j] = max(f[i - 1][j], f[i][j - 1]) + w[i][j];

        cout << f[n][m] << endl;
    }

    return 0;
}

3.最长上升子序列

#include<iostream>
#include<algorithm>

using namespace std;

const int N = 1010;

int n;
int a[N];//序列
int f[N];//状态

int main()
{
    scanf("%d",&n);
    for(int i = 1; i <= n;i++)  scanf("%d",&a[i]);
    
    for(int i = 1; i <= n;i++)
    {
        f[i] = 1;//只有i一个数a[i]
        for(int j = 1;j < i;j++)
            if(a[j] < a[i])
                f[i] = max(f[i],f[j] + 1);
    }
    
    int res = 0;
    //枚举所有终点
    for(int i = 1; i <= n;i++) res = max(res,f[i]);
    
    printf("%d",res);
    
    return 0;
}