【算法提高：动态规划】1.4 状态机模型 TODO

最新推荐文章于 2024-11-03 16:33:21 发布

Wei *

最新推荐文章于 2024-11-03 16:33:21 发布

阅读量256

点赞数

分类专栏：算法文章标签：算法动态规划 java 状态机 DP

本文链接：https://blog.csdn.net/qq_43406895/article/details/131948481

版权

算法专栏收录该内容

69 篇文章 7 订阅

订阅专栏

文章目录

例题列表

例题列表

1049. 大盗阿福（其实就是打家劫舍）

https://www.acwing.com/activity/content/problem/content/1287/
在这里插入图片描述

就是打家劫舍那道题。

对当前的房间选择抢或者不抢。

import java.io.BufferedInputStream;
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sin = new Scanner(new BufferedInputStream(System.in));
        int t = sin.nextInt();
        while (t-- != 0) {
            int n = sin.nextInt();
            int second = 0, pre = sin.nextInt();
            for (int i = 1; i < n; ++i) {
                int temp = pre;
                pre = Math.max(pre, second + sin.nextInt());
                second = temp;
            }
            System.out.println(pre);
        }
    }
}

1057. 股票买卖 IV（k笔交易）

https://www.acwing.com/problem/content/1059/

在这里插入图片描述

dp 数组多开一维表示第几笔交易就好了。

import java.io.BufferedInputStream;
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sin = new Scanner(new BufferedInputStream(System.in));
        int n = sin.nextInt(), k = sin.nextInt();
        int[] prices = new int[n];
        for (int i = 0; i < n; ++i) prices[i] = sin.nextInt();
        int[][] buy = new int[n][k], sell = new int[n][k];
        Arrays.fill(buy[0], -prices[0]);
        for (int i = 1; i < n; ++i) {
            buy[i][0] = Math.max(buy[i - 1][0], -prices[i]);
            sell[i][0] = Math.max(sell[i - 1][0], buy[i - 1][0] + prices[i]);
            for (int j = 1; j < k; ++j) {
                buy[i][j] = Math.max(buy[i - 1][j], sell[i - 1][j - 1] - prices[i]);
                sell[i][j] = Math.max(sell[i - 1][j], buy[i - 1][j] + prices[i]);
            }
        }
        System.out.println(sell[n - 1][k - 1]);
    }
}

1058. 股票买卖 V（冷冻期）

https://www.acwing.com/problem/content/1060/
在这里插入图片描述

限制 buy[i] 只能从 sell[i - 2] 转移过来就好了。

import java.io.BufferedInputStream;
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sin = new Scanner(new BufferedInputStream(System.in));
        int n = sin.nextInt();
        int[] buy = new int[n], sell = new int[n], prices = new int[n];
        for (int i = 0; i < n; ++i) prices[i] = sin.nextInt();
        buy[0] = -prices[0];
        buy[1] = Math.max(buy[0], -prices[1]);
        sell[1] = Math.max(sell[0], buy[0] + prices[1]);
        for (int i = 2; i < n; ++i) {
            buy[i] = Math.max(sell[i - 2] - prices[i], buy[i - 1]);
            sell[i] = Math.max(buy[i - 1] + prices[i], sell[i - 1]);
        }
        System.out.println(sell[n - 1]);
    }
}