//注意初始化的情况
class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.size() == 0) return 0;
vector<int> times(3, 0);
vector<vector<int>> status(2, times);
vector<vector<vector<int>>> dp(prices.size(), status);
dp[0][0][0] = 0;
dp[0][1][0] = -prices[0];
dp[0][1][1] = -prices[0];
dp[0][1][2] = -prices[0];
for (int i=1; i<prices.size(); i++){
dp[i][0][1] = max(dp[i-1][0][1], dp[i-1][1][0] + prices[i]);
dp[i][0][2] = max(dp[i-1][0][2], dp[i-1][1][1] + prices[i]);
dp[i][1][0] = max(dp[i-1][1][0], dp[i-1][0][0] - prices[i]);
dp[i][1][1] = max(dp[i-1][1][1], dp[i-1][0][1] - prices[i]);
dp[i][1][2] = max(dp[i-1][1][2], dp[i-1][0][2] - prices[i]);
}
return max(0, max(dp[prices.size()-1][0][1], dp[prices.size()-1][0][2]));
}
};