算法提高课第一章状态机模型

划定每一个状态
分析状态转移方程

1049. 大盗阿福 - AcWing题库

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

using namespace std;
const int N = 110000;
int a[N];
int dp[N][2];
int n;
int main()
{

    int t;
    cin >> t;
    while(t --)
    {
        cin >> n;
        for(int i = 1; i <= n; i ++ ) cin >> a[i];
        for(int i = 1; i <= n; i ++ )
        {
            dp[i][0] = max(dp[i - 1][1], dp[i - 1][0]);
            dp[i][1] = dp[i - 1][0] + a[i];
        }
        cout << max(dp[n][0], dp[n][1]) << endl;
    }
}

1057. 股票买卖 IV - AcWing题库

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

using namespace std;
int a[100100];
int dp[100100][101][2];
const int inf = 1e9;
int n, k;
//dp[i][j][0] 第i天正在进行第j笔交易处于买入的状态
int main()
{
    cin >> n >> k;
    for(int i = 1; i <= n; i ++ ) cin >> a[i];
    dp[0][0][0] = -inf;
    dp[0][0][1] = 0;
    for(int i = 1; i <= k; i ++ ) dp[0][i][0] = -inf; 
    int ans = 0;
    for(int i = 1; i <= n; i ++ )
    for(int j = 1; j <= k; j ++ )
    {
        dp[i][j][0] = max(dp[i - 1][j][0], dp[i - 1][j - 1][1] - a[i]);
        dp[i][j][1] = max( dp[i - 1][j][0] + a[i], dp[i - 1][j][1]);
        ans = max({ans, dp[i][j][0], dp[i][j][1]});
    }
    cout << ans;

}

1058. 股票买卖 V - AcWing题库

AcWing 1058. 股票买卖 V【线性DP+状态机模型DP+滚动数组优化】

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

using namespace std;
//第二天1冷冻期，2买股票，3卖股票，4啥也不干有股票，5啥也不干没股票。
int dp[100001][6];
int n;
int a[100001];
int main()
{
    cin >> n;
    for(int i = 1; i <= n; i ++ ) cin >> a[i];
    memset(dp, 0xcf, sizeof dp);
    dp[0][2] = 0;
    dp[0][5] = 0;

    for(int i = 1; i <= n; i ++ )
    {
        dp[i][1] = dp[i - 1][3] + a[i];
        dp[i][2] = max({dp[i - 1][1], dp[i - 1][5]});
        dp[i][3] = max({dp[i - 1][2] - a[i], dp[i - 1][4]});
        dp[i][4] = max(dp[i - 1][2] - a[i], dp[i - 1][4]);
        dp[i][5] = max(dp[i - 1][1], dp[i - 1][5]);
    }
    int ans = 0;
    for(int i = 1; i <= n; i ++ )
    for(int j = 1; j <= 5; j ++ )
        ans = max(ans, dp[i][j]);
    cout << ans;
}