Codeforces Round #672 (Div. 2) C1. Pokémon Army (easy version)

题目链接： C1. Pokémon Army (easy version)

---

大致题意:

给出一个数组a，给出q个数组成的数组b，其中b1<b2< b3…，使得a[b1] − a[b2] + a[b3] …最大,简单版q=0

---

解题思路:

前面是+，后面一定是-，前面是-，后面一定是+

定义f[i][0]表示到第i个元素结尾执行+的最大值，f[i][1]表示到第i个元素结尾执行-的最大值

转移方程： f[i][0] = max(f[i - 1][0], f[i - 1][1] + a[i]);
f[i][1] = max(f[i - 1][1], f[i - 1][0] - a[i]);

---

AC代码:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10;
ll a[N];
ll f[N][2];
int main() {
	int t; cin >> t;
	while (t--) {
		int n, q; cin >> n >> q;
		for (int i = 1; i <= n; ++i)cin >> a[i];
		for (int i = 1; i <= n; ++i) {
			f[i][0] = max(f[i - 1][0], f[i - 1][1] + a[i]);
			f[i][1] = max(f[i - 1][1], f[i - 1][0] - a[i]);
		}
		cout << max(f[n][0], f[n][1]) << endl;
	}
	return 0;
}

END