class Solution {
public:
int maxProfit(vector<int>& prices) {
int n = prices.size();
vector<vector<int>> dp(n, vector<int>(5));
dp[0][4] = -prices[0];
dp[0][0] = -prices[0];
for (int i = 1; i < prices.size(); i++) {
dp[i][0] = max(dp[i - 1][0], dp[i - 1][4]);
dp[i][1] = max(dp[i - 1][3], dp[i - 1][1]);
dp[i][2] = max(dp[i - 1][0] + prices[i],dp[i-1][4]+prices[i]);
dp[i][3] = dp[i - 1][2];
dp[i][4] = max(dp[i - 1][3] - prices[i], dp[i - 1][1] - prices[i]);
}
return *max_element(dp[n-1].begin(), dp[n-1].end());
}
};
10-28
437
05-01
38
02-02
533
10-02