309860: CF1747A. Two Groups
Memory Limit:256 MB
Time Limit:1 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Two Groups
题意翻译
你现在有一个由 $n$ 个字符组成的字符数组 $a$,现在请你将他们分成正好两组(正好指每一个元素在且仅在一个组内),使得 $\lvert sum_1 \rvert - \lvert sum_2 \rvert$ 的值尽可能大,请你求出这个最大值。 数据范围及样例输入输出见原题面。 Translated by @[CLCK](https://www.luogu.com.cn/user/323183)题目描述
You are given an array $ a $ consisting of $ n $ integers. You want to distribute these $ n $ integers into two groups $ s_1 $ and $ s_2 $ (groups can be empty) so that the following conditions are satisfied: - For each $ i $ $ (1 \leq i \leq n) $ , $ a_i $ goes into exactly one group. - The value $ |sum(s_1)| - |sum(s_2)| $ is the maximum possible among all such ways to distribute the integers.Here $ sum(s_1) $ denotes the sum of the numbers in the group $ s_1 $ , and $ sum(s_2) $ denotes the sum of the numbers in the group $ s_2 $ . Determine the maximum possible value of $ |sum(s_1)| - |sum(s_2)| $ .输入输出格式
输入格式
The input consists of multiple test cases. The first line contains a single integer $ t $ $ (1 \leq t \leq 2 \cdot 10^4) $ — the number of test cases. The description of the test cases follows. The first line of each test case contains a single integer $ n $ $ (1 \leq n \leq 10^5) $ — the length of the array $ a $ . The second line of each test case contains $ n $ integers $ a_1,a_2 \ldots a_n $ $ (-10^9 \leq a_i \leq 10^9) $ — elements of the array $ a $ . It is guaranteed that the sum of $ n $ over all test cases does not exceed $ 2\cdot 10^5 $ .
输出格式
For each test case, output a single integer — the maximum possible value of $ |sum(s_1)| - |sum(s_2)| $ .
输入输出样例
输入样例 #1
4
2
10 -10
4
-2 -1 11 0
3
2 3 2
5
-9 2 0 0 -4
输出样例 #1
0
8
7
11