2024-02-06（线性DP、区间DP）

1.线性DP

898. 数字三角形 - AcWing题库

 

从上到下来遍历 

import java.util.*;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int N = 520;
        int INF = (int)1e9;
        int[][] a = new int[N][N];
        int[][] f = new int[N][N];
        
        //输入数据
        int n = sc.nextInt();
        for(int i = 1; i <= n; i ++){
            for(int j = 1; j <= i; j ++){
                a[i][j] = sc.nextInt();
            }
        }
        
        //或者可以用Arrays.fill全部初始化
        for(int i = 0; i <= n; i ++){//这里初始化的时候要注意边界问题
            for(int j = 0; j <= i + 1; j ++){//在最左边的点的时候，会有左上的点，在最右边的点的时候，会有右上的点，所以要取多一点
                f[i][j] = -INF;
            }
        }
        
        f[1][1] = a[1][1];//第一行就是原本的值
        
        for(int i = 2; i <= n; i ++){//根据DP的思路来算
            for(int j = 1; j <= i; j ++){
                //比较大小
                f[i][j] = Math.max(f[i - 1][j - 1] + a[i][j], f[i - 1][j] + a[i][j]);
            }
        }
        
        int res = -INF;//初始化res
        for(int i = 1; i <= n; i ++){
            res = Math.max(res, f[n][i]);//比较最后一行哪个最大
        }
        
        System.out.print(res);
    }
}

895. 最长上升子序列 - AcWing题库

 

import java.util.*;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int N = 1010;
        int[] a = new int[N];
        int[] f = new int[N];
        
        //输入数据
        for(int i = 1; i <= n; i ++){
            a[i] = sc.nextInt();
        }
        
        //根据DP的分析
        for(int i = 1; i <= n; i ++){
            f[i] = 1;
            for(int j = 1; j < i; j ++){
                if(a[i] > a[j]) f[i] = Math.max(f[i], f[j] + 1);
            }
        }
        
        //遍历数组，找到最大值
        int res = 0;
        for(int i = 1; i <= n; i ++){
            res = Math.max(res, f[i]);
        }
        System.out.print(res);
    }
}

 896. 最长上升子序列 II - AcWing题库

与上一题相比，不同之处在于这道题的数据范围比较大 

import java.util.*;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int N = 100010;
        int[] a = new int[N];//数据
        int[] q = new int[N];//q[i]表示的是长度为i的所有上升子序列的最小的结尾值
        
        //输入数据
        for(int i = 0; i < n; i ++) a[i] = sc.nextInt();
        
        int len = 0;//初始化长度为0
        for(int i = 0; i < n; i ++){//循环遍历每个a[i]
            //二分查找在数组q中中找到所有长度的子序列中比a[i]小的最大结尾值是属于q的哪个长度
            int l = 0;
            int r = len;
            while(l < r){
                int mid = r + l + 1 >> 1;
                if(q[mid] < a[i]) l = mid;
                else r = mid - 1;
            }
            len = Math.max(len, r + 1);//这里的r指的是在q中的下标
            q[r + 1] = a[i];//更新数组q的相应下标的值
        }
        System.out.print(len);
    }
}

 897. 最长公共子序列 - AcWing题库

import java.util.*;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int N = 1010;
        char[] a = new char[N];
        char[] b = new char[N];
        int[][] f = new int[N][N];
        
        int n = sc.nextInt();
        int m = sc.nextInt();
        String A = sc.next();
        String B = sc.next();
        
        //转换成字符数组
        for(int i = 1; i <= n; i ++) a[i] = A.charAt(i - 1);
        for(int i = 1; i <= m; i ++) b[i] = B.charAt(i - 1);
        
        //根据DP分析
        for(int i = 1; i <= n; i ++){
            for(int j = 1; j <= m; j ++){
                f[i][j] = Math.max(f[i - 1][j], f[i][j - 1]);
                //最后一种11的情况，就是说一定包含a[i]和b[j]，那么就是说子序列最后一个元素相等，就是它俩相等
                if(a[i] == b[j]) f[i][j] = Math.max(f[i][j], f[i - 1][j - 1] + 1);
            }
        }
        
        System.out.print(f[n][m]);
    }
}

 902. 最短编辑距离 - AcWing题库

 

import java.util.*;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int N = 1010;
        char[] a = new char[N];
        char[] b = new char[N];
        int[][] f = new int[N][N];
        
        int n = sc.nextInt();
        String A = sc.next();
        for(int i = 1; i <= n; i ++){
            a[i] = A.charAt(i - 1);
            f[i][0] = i;//初始化 假设a的长度为i，b的长度为0。要使a变b，那么就要进行i次操作
        }
        int m = sc.nextInt();
        String B = sc.next();
        for(int i = 1; i <= m; i ++){
            b[i] = B.charAt(i - 1);
            f[0][i] = i;同上
        }
        
        //DP思想
        for(int i = 1; i <= n; i ++){
            for(int j = 1; j <= m; j ++){
                //删除和插入操作
                f[i][j] = Math.min(f[i - 1][j] + 1, f[i][j - 1] + 1);
                //改（分情况讨论）
                if(a[i] != b[j]) f[i][j] = Math.min(f[i][j], f[i - 1][j - 1] + 1);
                else f[i][j] = Math.min(f[i][j], f[i - 1][j - 1]);
            }
        }
        System.out.print(f[n][m]);
    }
}

 899. 编辑距离 - AcWing题库

和上一道的的思路一样，有一点变动 

import java.util.*;

public class Main{
    static int N = 1010, n, m;
    static String[] str = new String[N];
    static int[][] f = new int[N][N];
    
    public static int get(String a, String b){
        int la = a.length();//记录两个字符串的长度
        int lb = b.length();
        
        for(int i = 1; i <= la; i ++){//初始化很重要，不能偷懒
            f[i][0] = i;
        }
        for(int i = 1; i <= lb; i ++){
            f[0][i] = i;
        }
        
        for(int i = 1; i <= la; i ++){
            for(int j = 1; j <= lb; j ++){
                f[i][j] = Math.min(f[i - 1][j] + 1, f[i][j - 1] + 1);
                f[i][j] = Math.min(f[i][j], f[i - 1][j - 1] + (a.charAt(i - 1) == b.charAt(j - 1) ? 0 : 1));
            }
        }
        return f[la][lb];
    }
    
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        m = sc.nextInt();
        
        for(int i = 1; i <= n; i ++){
            str[i] = sc.next();//录入n个字符串
        }
        for(int i = 1; i <= m; i ++){
            String s = sc.next();
            int limit = sc.nextInt();
            int res = 0;
            for(int j = 1; j <= n; j ++){
                if(get(str[j], s) <= limit) res ++;//遍历每个字符串，符合要求，结果就加一
            }
            System.out.println(res);
        }
    }
}

2.区间DP

282. 石子合并 - AcWing题库

import java.util.*;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int N = 310;
        int[] s = new int[N];
        int[][] f = new int[N][N];
        
        //录入数据
        int n = sc.nextInt();
        for(int i = 1; i <= n; i ++) s[i] = sc.nextInt();
        
        //算出前缀和
        for(int i = 1; i <= n; i ++) s[i] += s[i - 1];
        
        for(int len = 2; len <= n; len ++){//长度
            for(int i = 1; i + len - 1 <= n; i ++){//起点
                int l = i;
                int r = i + len - 1;
                f[l][r] = (int)1e9;
                for(int k = l; k < r; k ++){//在当前起点和长度的情况下进行再划分
                    //根据DP思想分析进行
                    f[l][r] = Math.min(f[l][r], f[l][k] + f[k + 1][r] + s[r] - s[l - 1]);
                }
            }
        }
        //输出答案
        System.out.print(f[1][n]);
    }
}