Codeforces Round #849 (Div. 4)Negatives and Positives

A. Negatives and Positives

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Given an array a� consisting of n� elements, find the maximum possible sum the array can have after performing the following operation any number of times:

• Choose 22 adjacent elements and flip both of their signs. In other words choose an index i� such that 1≤i≤n−11≤�≤�−1 and assign ai=−ai��=−�� and ai+1=−ai+1��+1=−��+1.

Input

The input consists of multiple test cases. The first line contains an integer t� (1≤t≤10001≤�≤1000) — the number of test cases. The descriptions of the test cases follow.

The first line of each test case contains an integer n� (2≤n≤2⋅1052≤�≤2⋅105) — the length of the array.

The following line contains n� space-separated integers a1,a2,…,an�1,�2,…,�� (−109≤ai≤109−109≤��≤109).

It is guaranteed that the sum of n� over all test cases does not exceed 2⋅1052⋅105.

Output

For each test case, output the maximum possible sum the array can have after performing the described operation any number of times.

Example

input

Copy

5

3

-1 -1 -1

5

1 5 -5 0 2

3

1 2 3

6

-1 10 9 8 7 6

2

-1 -1

output

Copy

1
13
6
39
2

Note

For the first test case, by performing the operation on the first two elements, we can change the array from [−1,−1,−1][−1,−1,−1] to [1,1,−1][1,1,−1], and it can be proven this array obtains the maximum possible sum which is 1+1+(−1)=11+1+(−1)=1.

For the second test case, by performing the operation on −5−5 and 00, we change the array from [1,5,−5,0,2][1,5,−5,0,2] to [1,5,−(−5),−0,2]=[1,5,5,0,2][1,5,−(−5),−0,2]=[1,5,5,0,2], which has the maximum sum since all elements are non-negative. So, the answer is 1+5+5+0+2=131+5+5+0+2=13.

For the third test case, the array already contains only positive numbers, so performing operations is unnecessary. The answer is just the sum of the whole array, which is 1+2+3=61+2+3=6.

方法一：

常规做法：

#include <bits/stdc++.h>
using namespace std;
const int N=3e5+10;
long long  a[N],b[N];
int main(){
	int t;
	cin>>t;
	while(t--){
		int n,ans=0;
		long long sum=0,mi=2e9;
		cin>>n;
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		for(int i=1;i<=n;i++){
			cin>>a[i];
			mi=min(mi,abs(a[i]));
			if(a[i]<0)ans++;
		}
		for(int i=1;i<=n;i++){
			sum+=abs(a[i]);
		}
		if(ans&1)sum-=2*mi;
		cout<<sum<<endl;
	}
	return 0;
}

方法二：

dp(动态规划）;

#include <bits/stdc++.h>
using namespace std;
const int N=2e5+10;
long long a[N],dp[4][N];
int main(){
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		for(int i=0;i<n;i++)cin>>a[i];
		dp[0][0]=a[0];
		dp[1][0]=-a[0];
		//0和1分别代表不操作和操作
		for(int i=1;i<n;i++){
			dp[0][i]=max(dp[0][i-1]+a[i],dp[1][i-1]-a[i]);//在前一个最大值的基础上操作和不操作的最大值
			dp[1][i]=max(dp[0][i-1]-a[i],dp[1][i-1]+a[i]);
		}
		cout<<dp[0][n-1]<<endl;
		
	}
	return 0;
}