题意: 现有一个数组a,你可以翻转一次任意一段子序列,以使所有偶数位(下标从0开始)的和max。
思路:
- 显然选择的序列必须是偶数个数,因为奇数个数翻转后根本没有意义(在实现代码时下标可以从1开始方便处理,取奇数位的和便可);并先统计所有奇数位的和ans,再从前往后遍历
- 先处理偶数位 i 与 i - 1 的交换情况;不断统计交换后的贡献值,若贡献值为负便舍弃前面的子段(就像dp思维一样),最后统计所有贡献值的max为maxx1
- 再处理偶数位 i 与 i + 1 的交换情况,和上一种情况一样取出贡献值maxx2
- 最后的ans再加上max(maxx1,maxx2)即可
代码实现:
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <cstring>
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;
int t, n;
int a[N];
signed main()
{
IOS;
cin >> t;
while(t --){
cin >> n;
int ans = 0, sum1 = 0, maxx1 = 0, sum2 = 0, maxx2 = 0;
for(int i = 1; i <= n; i ++){
cin >> a[i];
if(i % 2) ans += a[i];
}
for(int i = 2; i <= n; i += 2){
//求偶数位i对奇数位i - 1的贡献值
sum1 = max(0LL, sum1 + a[i] - a[i - 1]);
maxx1 = max(maxx1, sum1);
}
for(int i = 3; i <= n; i += 2){
//求偶数位i - 1对奇数位i的贡献值
sum2 = max(0LL, sum2 + a[i - 1] - a[i]);
maxx2 = max(maxx2, sum2);
}
ans += max(maxx1, maxx2);
cout << ans << endl;
}
return 0;
}