A. Turtle Puzzle: Rearrange and Negate
A. Turtle Puzzle: Rearrange and Negate
time limit per test
2 secondsmemory limit per test
256 megabytesYou are given an array of integers. You must perform the following two operations on the array (the first, then the second):
- Arbitrarily rearrange the elements of the array or leave the order of its elements unchanged.
- Choose at most one contiguous segment of elements and replace the signs of all elements in this segment with their opposites. Formally, you can choose a pair of indices such that and assign for all (negate elements). Note that you may choose not to select a pair of indices and leave all the signs of the elements unchanged.
What is the maximum sum of the array elements after performing these two operations (the first, then the second)?
Input
The first line of the input contains a single integer () — the number of test cases. The descriptions of the test cases follow.
The first line of each test case contains a single integer () — the number of elements in array .
The second line of each test case contains integers () — elements of the array.
Output
For each test case, output the maximum sum of the array elements after sequentially performing the two given operations.
- #include<iostream>
- using namespace std;
- int main()
- {
- int test,n;
- cin>>test;
- while(test--){
- int sum=0;
- int i=0;
- cin>>n;
- int a[n];
- for( i=0;i<n;i++)
- {
- cin>>a[i];
- sum = sum + abs(a[i]);
- }
- cout << sum << endl;
- sum=0;
- }
- return 0;
- }
Comments
Post a Comment