线性Dp习题

AcWing 896. 最长上升子序列 II

样例：

7
3 1 2 1 8 5 6

思路 ：

Dp思想 + 单调队列 + 二分查找

代码：

#include <iostream>
#include <algorithm>

using namespace std;


const int N = 100010;
int a[N];//读入序列
int q[N];//存储所有长度的最大上升子序列的最后一位最小的数
int main()
{
    int n;
    scanf("%d", &n);
    
    for (int i = 0; i < n; i ++ ) scanf("%d", &a[i]);
    
    q[0] = -2e9;
    int len = 0;
    
    for (int i = 0; i < n; i ++ )
    {
        int l = 0, r = len;
        while (l < r)
        {
            int mid = (l + r + 1) / 2;
            if (q[mid] < a[i]) l = mid;//a[i]在右边，更新左边界
            else r =  mid - 1;//a[i]在左边，更新右边界
        }
        len = max(len, r + 1);
        q[r + 1] = a[i];    
    }
    
    printf("%d", len);
    return 0;
}

---

AcWing 902. 最短编辑距离

样例：

10 
AGTCTGACGC
11 
AGTAAGTAGGC

思路：

代码：

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

using namespace std;

const int N = 1010;
int f[N][N];
char a[N], b[N];
int n, m;
int main()
{
    cin >> n >> a + 1 >> m >> b + 1;
    
    for (int i = 1; i <= n; i ++ ) f[i][0] = i;
    for (int i = 1; i <= m; i ++ ) f[0][i] = 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] + 1);
            else f[i][j] = min(f[i][j], f[i - 1][j - 1]);
        }
    }
    
    cout << f[n][m] << endl;
}

---

AcWing 899. 编辑距离

样例：

 3 2
abc
acd
bcd
ab 1
acbd 2

思路：

最短编辑距离的简单应用

代码：

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

using namespace std;

const int N = 15, M = 1010;
int n, m;
int f[N][N];
char str[M][N];

int edit_distance(char a[], char b[])
{
    int la = strlen(a + 1), lb = strlen(b + 1);
    
    for (int i = 0; i <= la; i ++ ) f[i][0] = i;
    for (int i = 0; i <= lb; i ++ ) f[0][i] = i;
    
    for (int i = 1; i <= la; i ++ )
    {
        for (int j = 1; j <= lb; j ++ )
        {
            f[i][j] = min(f[i - 1][j] + 1, f[i][j - 1] + 1);
            f[i][j] = min(f[i][j], f[i - 1][j - 1] + (a[i] != b[j]));
        }
    }
    
    return f[la][lb];
}
int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i ++ ) scanf("%s",str[i] + 1);
    
    while (m --)
    {
        int limit, res = 0;
        char s[N];
        scanf("%s%d", s + 1, &limit);
        
        for (int i = 0; i < n; i ++ )
            if (edit_distance(str[i], s) <= limit) res ++;
            
        printf("%d\n", res);
    }
    
}

---

AcWing 900. 整数划分

样例：

5

方法一： 

思路：

完全背包问题的变形应用

状态表示的优化过程 

代码： 

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1010, mod = 1e9 + 7;
int f[N];

int main()
{
    int n;
    scanf("%d", &n);
    
    f[0] = 1;
    
    for (int i = 1; i <= n; i ++ )
        for (int j = i; j <= n; j ++)
            f[j] = (f[j] + f[j - i]) % mod;
            
    printf("%d\n", f[n]);
    
    return 0;
}

方法二：

思路：

代码：

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1010, mod = 1e9 + 7;
int f[N][N];

int main()
{
    int n;
    scanf("%d", &n);
    
     f[0][0] = 1;
    
    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= i; j ++)
            f[i][j] = (f[i - 1][j - 1] + f[i - j][j]) % mod;
            
    int res = 0;
    for (int i = 1; i <= n; i ++ ) res = (res + f[n][i]) % mod;
             
            
    printf("%d\n", res);
    
    return 0;
}