【动态规划】—— 线性DP

---

例题：AcWing 898. 数字三角形

---

---

AC代码 

#include <iostream>
#include <algorithm>
using namespace std;

const int N = 510, INF = 1e9;

int n;
int a[N][N];
int f[N][N];

int main()
{
    cin >> n;
    for(int i = 1; i <= n; i ++ )
        for(int j = 1; j <= i; j ++ )
            scanf("%d", &a[i][j]);
    
    for(int i = 0; i <= n; i ++ )
        for(int j = 0; j <= n; j ++ )
            f[i][j] = -INF;
    
    f[1][1] = a[1][1];
    for(int i = 2; i <= n; i ++ )
        for(int j = 1; j <= i; j ++ )
            f[i][j] = max(f[i - 1][j], f[i - 1][j - 1]) + a[i][j];
    
    
    int res = -INF;
    for(int i = 1; i <= n; i ++ ) res = max(res, f[n][i]);
    cout << res << endl;
    return 0;
}

---

例题：AcWing 895. 最长上升子序列 （LIS）

---

朴素做法的DP公式： 

#include <iostream>
#include <algorithm>
using namespace std;

const int N = 1010;

int n;
int a[N], f[N];

int main()
{
    cin >> n;
    for(int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);
    
    for(int i = 1; i <= n; i ++ )
    {
        f[i] = 1; // 只有a[i]一个数的情况
        for(int j = 1; j <= i - 1; 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]);
    
    cout << res << endl;
    
    return 0;
}

---

记录最长上升子序列 （逆序）

#include <iostream>
#include <algorithm>
using namespace std;

const int N = 1010;

int n;
int a[N], f[N];
int g[N];

int main()
{
    cin >> n;
    for(int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);
    
    for(int i = 1; i <= n; i ++ )
    {
        f[i] = 1; // 只有a[i]一个数的情况
        for(int j = 1; j <= i - 1; j ++ )
            if(a[j] < a[i])
                if(f[i] < f[j] + 1)
                {
                    f[i] = f[j] + 1;
                    g[i] = j;
                }
    }
    
    int k = 1;
    for(int i = 1; i <= n; i ++ )
        if(f[k] < f[i])
            k = i;
    
    for(int i = 0, len = f[k]; i < len; i ++ )
    {
        cout << a[k] << ' ';
        k = g[k];
    }
    
    return 0;
}

---

AcWing 896. 最长上升子序列 II 

 

---

利用一个数组存下不同长度的最长上升子序列的数 ，可以发现它是单调递增的

---

---

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 100010;

int n;
int a[N];
int q[N];

int main()
{
    cin >> n;
    for(int i = 0; i < n; i ++ ) scanf("%d", &a[i]);
    
    int len = 0;
    q[0] = -2e9;
    for(int i = 0; i < n; i ++ )
    {
        int l = 0, r = len;
        while(l < r)
        {
            int mid = l + r + 1 >> 1;
            if(q[mid] < a[i]) l = mid;
            else r = mid - 1;
        }
        len = max(len, r + 1);
        q[r + 1] = a[i];
    }
    
    cout << len << endl;
    
    return 0;
}

---

AcWing 902. 最短编辑距离 

输入样例：

10 
AGTCTGACGC
11 
AGTAAGTAGGC

输出样例：

4

---

---

#include <iostream>
#include <algorithm>
using namespace std;

const int N = 1010;

int n, m;
char a[N], b[N];
int f[N][N];

int main()
{
    scanf("%d%s", &n, a + 1);
    scanf("%d%s", &m, b + 1);
    
    for(int i = 0; i <= m; i ++ ) f[0][i] = i;
    for(int i = 0; i <= n; i ++ ) f[i][0] = i;
    
    for(int i = 1; i <= n; i ++ )
        for(int j = 1; j <= m; j ++ )
        {
            f[i][j] = min(f[i - 1][j] + 1, f[i][j - 1] + 1);
            if(a[i] == b[j]) f[i][j] = min(f[i][j], f[i - 1][j - 1]);
            else f[i][j] = min(f[i][j], f[i - 1][j - 1] + 1);
        }
    
    cout << f[n][m] << endl;
    
    return 0;
}

---

AcWing 897. 最长公共子序列

---

 

---

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1010;

int n, m;
char a[N], b[N];
int f[N][N];

int main()
{
    cin >> n >> m;
    scanf("%s%s",a + 1, b + 1);
    
    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]);
            if(a[i] == b[j]) f[i][j] = max(f[i][j], f[i - 1][j - 1] + 1);
        }
    cout << f[n][m] << endl;
    return 0;
}

---