AcWing 1058 股票买卖 V 题解 （动态规划—DP—状态机问题）

原题传送门

#include<bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10, INF = 0x3f3f3f;

int n;
int w[N];
int f[N][3]; 

int main()
{
	cin>>n;
	for(int i = 1; i <= n; i ++ ){
		cin>>w[i];
	}
	
	f[0][2] = 0;
	f[0][0] = -INF;
	f[0][1] = -INF;
	for(int i = 1; i <= n; i ++ ){
		f[i][0] = max(f[i - 1][0], f[i - 1][2] - w[i]);
		f[i][1] = f[i - 1][0] + w[i];
		f[i][2] = max(f[i - 1][2], f[i - 1][1]); 
	}
	
	int res = 0;
	for(int i = 1; i <= n; i ++ ) res = max(res, max(f[i][1], f[i][2]));
	
	cout<<res<<endl;
	return 0;
}