C1. Pokémon Army (easy version)

C1. Pokémon Army (easy version)

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 nn pikachu. The strength of the ii-th pokémon is equal to aiai, 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 bb from kk indices such that 1≤b1<b2<⋯<bk≤n1≤b1<b2<⋯<bk≤n, and his army will consist of pokémons with forces ab1,ab2,…,abkab1,ab2,…,abk.

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

Andrew is experimenting with pokémon order. He performs qq operations. In ii-th operation Andrew swaps lili-th and riri-th pokémon.

Note: q=0q=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 tt (1≤t≤1031≤t≤103) denoting the number of test cases. Description of the test cases follows.

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

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

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

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

Output

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

Example

input

Copy

3
3 0
1 3 2
2 0
1 2
7 0
1 2 5 4 3 6 7

output

Copy

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=95−3+7=9.

=========================================================================

比较好玩的贪心，我们加的时候找递增的末尾，减的时候找递减的末尾即可

#include<iostream>
# include<algorithm>
# include<unordered_map>

using namespace std;
typedef long long int  ll;
int a[300000+10];
int main ()
{

    int t;
    cin>>t;

    while(t--)
    {
        int n;
        cin>>n;
        int p;
        cin>>p;
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
        }
        int now=1;
        ll ans=0;
        int temp;
        for(int i=1;i<n;i++)
        {
            if(now==1)
            {
                if(a[i]<a[i+1])
                {
                    temp=a[i+1];
                }
                else
                {
                    temp=a[i];
                    ans+=temp;
                    now=0;
                }
            }
            else if(now==0)
            {
                if(a[i]>a[i+1])
                {
                    temp=a[i+1];

                }
                else
                {
                    temp=a[i];
                    ans-=temp;
                    now=1;
                }
            }

        }

        if(now==1)
        {
            ans+=a[n];
        }

        cout<<ans<<endl;
    }

    return 0;

}