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

This is the easy version of the problem. The difference between the versions is that the easy version has no swap operations. You can make hacks only if all versions of the problem are solved.

Pikachu is a cute and friendly pokémon living in the wild pikachu herd.

But it has become known recently that infamous team R wanted to steal all these pokémon! Pokémon trainer Andrew decided to help Pikachu to build a pokémon army to resist.

First, Andrew counted all the pokémon — there were exactly n pikachu. The strength of the i-th pokémon is equal to ai, and all these numbers are distinct.

As an army, Andrew can choose any non-empty subsequence of pokemons. In other words, Andrew chooses some array b from k indices such that 1≤b1<b2<⋯<bk≤n, and his army will consist of pokémons with forces ab1,ab2,…,abk.

The strength of the army is equal to the alternating sum of elements of the subsequence; that is, ab1−ab2+ab3−ab4+….

Andrew is experimenting with pokémon order. He performs q operations. In i-th operation Andrew swaps li-th and ri-th pokémon.

Note: q=0 in this version of the task.

Andrew wants to know the maximal stregth of the army he can achieve with the initial pokémon placement. He also needs to know the maximal strength after each operation.

Help Andrew and the pokémon, or team R will realize their tricky plan!

Input
Each test contains multiple test cases.

The first line contains one positive integer t (1≤t≤103) denoting the number of test cases. Description of the test cases follows.

The first line of each test case contains two integers n and q (1≤n≤3⋅105,q=0) denoting the number of pokémon and number of operations respectively.

The second line contains n distinct positive integers a1,a2,…,an (1≤ai≤n) denoting the strengths of the pokémon.

i-th of the last q lines contains two positive integers li and ri (1≤li≤ri≤n) denoting the indices of pokémon that were swapped in the i-th operation.

It is guaranteed that the sum of n over all test cases does not exceed 3⋅105, and the sum of q over all test cases does not exceed 3⋅105.

Output
For each test case, print q+1 integers: the maximal strength of army before the swaps and after each swap.

Example
inputCopy
3
3 0
1 3 2
2 0
1 2
7 0
1 2 5 4 3 6 7
outputCopy
3
2
9
Note
In third test case we can build an army in such way: [1 2 5 4 3 6 7], its strength will be 5−3+7=9.

题意：
给出长度为n的序列 n为3e5
构造一个序列 使得这个序列奇数位的和 减去 偶数位的和 最大， 求这个最大值

思路：
dp。
用f[i][0] 表示当前位i 之前奇数位作为结束的 序列最大值
用f[i][1] 表示当前位i 之前偶数位作为结束的 序列最大值
对于当前位i 上的数字 有选或者不选 不选的直接从上一个相同状态转移
选的话 如果是奇数位 从偶数位上的 上一个状态转移过来 ， 反之 从奇数位上转移过来
具体看代码

#include <bits/stdc++.h>

using namespace std;

const int N = 3e5 + 50;

#define LL long long

int a[N];
LL f[N][2];// 0为 奇数  1为偶数

int main(){
    int t;
    cin >> t;

    while(t --){
        int n , q;
        cin >> n >> q;

        for(int i = 0;i < n;i ++){
            cin >> a[i];
            f[i][0] = f[i][1] = -1e18;
        }
        
        f[0][0] = a[0],f[0][1] = 0;//奇数位 0 为a0 

        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 - 1][0],f[n - 1][1]) << '\n';
    }
    return 0;
}