完全背包问题实例 acwing 1055

acwing 1055 股票买卖II

#include<iostream>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>

using namespace std;

typedef long long ll;

//f[0]表示无买入
//f[1]表示手中有股票 
int main(){
	int N;
	cin >> N;
	ll x;
	ll f[2][10010];
	memset( f, 0xcf, sizeof(f));//初始化为负无穷 
	f[0][0] = 0;
	for(int i = 1; i <= N; i++ ){
		cin >> x;
		f[1][i] = max ( f[0][i - 1] - x, f[1][i - 1]);
		f[0][i] = max ( f[1][i - 1] + x, f[0][i - 1]);
	}
	cout << max( f[0][N], f[1][N] ) << endl;
	return 0;
}