19d-Jumping Cows

#include <iostream>
using namespace std;
//找最大子序列和,加减交替
int main() {
	int n, tmp,max, min, ans = 0;
	cin >> n;
	cin >> max;
	min = 0;
	for (int i = 1; i < n; i++) {
		cin >> tmp;
		//保证min<max,序列和递增
		if ((min == 0 || tmp < min) && !(max != 0 && tmp > max)) {
			min = tmp;
			ans += max;
			max = 0;//不能服用两次药水，轮到-min
			continue;
		}
		if (tmp > max) {
			max = tmp;
			ans -= min;
			min = 0;
		}
	}
	ans += max;//最后一次+max
	cout << ans << endl;
	return 0;
}