Maximum possible array sum after performing the given operation
Last Updated :
12 Jul, 2025
Given an array arr[] of size N, the task is to find the maximum sum of the elements of the array after applying the given operation any number of times. In a single operation, choose an index 1 ? i < N and multiply both arr[i] and arr[i - 1] by -1.
Examples:
Input: arr[] = {-10, 5, -4}
Output: 19
Perform the operation for i = 1 and
the array becomes {10, -5, -4}
Perform the operation for i = 2 and
the array becomes {10, 5, 4}
10 + 5 + 4 = 19
Input: arr[] = {10, -4, -8, -11, 3}
Output: 30
Approach: This problem can be solved using dynamic programming. Since it is useless to choose and flip the same arr[i], we will consider flipping at most once for each element of the array in order from the left. Let dp[i][0] represents the maximum possible sum up to the ith index without flipping the ith index. dp[i][1] represents the maximum possible sum up to the ith index with flipping the ith index. So, dp(n, 0) is our required answer.
Base conditions:
- dp[0][0] = 0
- dp[0][1] = INT_MIN
Recurrence relation:
- dp[i + 1][0] = max(dp[i][0] + arr[i], dp[i][1] - arr[i])
- dp[i + 1][1] = max(dp[i][0] - arr[i], dp[i][1] + arr[i])
Below is the implementation of the above approach:
C++
// C++ implementation of the approach
#include <bits/stdc++.h>
using namespace std;
// Function to return the maximum possible
// sum after performing the given operation
int max_sum(int a[], int n)
{
// Dp vector to store the answer
vector<vector<int> > dp(n + 1,
vector<int>(2, 0));
// Base value
dp[0][0] = 0, dp[0][1] = -999999;
for (int i = 0; i <= n - 1; i++) {
dp[i + 1][0] = max(dp[i][0] + a[i],
dp[i][1] - a[i]);
dp[i + 1][1] = max(dp[i][0] - a[i],
dp[i][1] + a[i]);
}
// Return the maximum sum
return dp[n][0];
}
// Driver code
int main()
{
int a[] = { -10, 5, -4 };
int n = sizeof(a) / sizeof(a[0]);
cout << max_sum(a, n);
return 0;
}
// Java implementation of the approach
class GFG
{
// Function to return the maximum possible
// sum after performing the given operation
static int max_sum(int a[], int n)
{
// Dp vector to store the answer
int [][]dp = new int[n + 1][2];
// Base value
dp[0][0] = 0; dp[0][1] = -999999;
for (int i = 0; i <= n - 1; i++)
{
dp[i + 1][0] = Math.max(dp[i][0] + a[i],
dp[i][1] - a[i]);
dp[i + 1][1] = Math.max(dp[i][0] - a[i],
dp[i][1] + a[i]);
}
// Return the maximum sum
return dp[n][0];
}
// Driver code
public static void main(String[] args)
{
int a[] = { -10, 5, -4 };
int n = a.length;
System.out.println(max_sum(a, n));
}
}
// This code is contributed by 29AjayKumar
# Python implementation of the approach
# Function to return the maximum possible
# sum after performing the given operation
def max_sum(a, n):
# Dp vector to store the answer
dp = [[0 for i in range(2)] for j in range(n+1)]
# Base value
dp[0][0] = 0; dp[0][1] = -999999;
for i in range(0, n):
dp[i + 1][0] = max(dp[i][0] + a[i],
dp[i][1] - a[i]);
dp[i + 1][1] = max(dp[i][0] - a[i],
dp[i][1] + a[i]);
# Return the maximum sum
return dp[n][0];
# Driver code
if __name__ == '__main__':
a = [-10, 5, -4 ];
n = len(a);
print(max_sum(a, n));
# This code is contributed by 29AjayKumar
<script>
// javascript implementation of the approach // Function to return the maximum possible
// sum after performing the given operation
function max_sum(a , n) {
// Dp vector to store the answer
var dp = Array(n + 1).fill().map(()=>Array(2).fill(0));
// Base value
dp[0][0] = 0;
dp[0][1] = -999999;
for (i = 0; i <= n - 1; i++) {
dp[i + 1][0] = Math.max(dp[i][0] + a[i], dp[i][1] - a[i]);
dp[i + 1][1] = Math.max(dp[i][0] - a[i], dp[i][1] + a[i]);
}
// Return the maximum sum
return dp[n][0];
}
// Driver code
var a = [ -10, 5, -4 ];
var n = a.length;
document.write(max_sum(a, n));
// This code is contributed by todaysgaurav
</script>
// C# implementation of the approach
using System;
class GFG
{
// Function to return the maximum possible
// sum after performing the given operation
static int max_sum(int []a, int n)
{
// Dp vector to store the answer
int [,]dp = new int[n + 1, 2];
// Base value
dp[0, 0] = 0; dp[0, 1] = -999999;
for (int i = 0; i <= n - 1; i++)
{
dp[i + 1, 0] = Math.Max(dp[i, 0] + a[i],
dp[i, 1] - a[i]);
dp[i + 1, 1] = Math.Max(dp[i, 0] - a[i],
dp[i, 1] + a[i]);
}
// Return the maximum sum
return dp[n, 0];
}
// Driver code
public static void Main(String[] args)
{
int []a = { -10, 5, -4 };
int n = a.Length;
Console.WriteLine(max_sum(a, n));
}
}
// This code is contributed by PrinciRaj1992
Time Complexity: O(N), as we are using a loop to traverse N times so it will cost us O(N) time.
Auxiliary Space: O(N), as we are using extra space for DP.
Efficient approach : Space Optimization O(1)
To optimize the space complexity in previous code we are only using the previous row of the dp table to compute the values of the current row. Therefore, we can maintain just two variables to keep track of the values of the previous row instead of using a 2D vector. This will reduce the space complexity from O(N) to O(1).
Implementation Steps:
- Initialize two variables prev0 and prev1 to 0 and -999999 respectively.
- Loop through the input array from index 0 to n-1.
- Compute two new variables curr0 and curr1 as follows.
- curr0 is the maximum of (prev0 + a[i]) and (prev1 - a[i])
- curr1 is the maximum of (prev0 - a[i]) and (prev1 + a[i])
- Update prev0 to curr0 and prev1 to curr1 for further iteration.
- At last return final answer stored in prev0.
Implementation:
C++
// C++ code for above approach
#include <bits/stdc++.h>
using namespace std;
// Function to return the maximum possible
// sum after performing the given operation
int max_sum(int a[], int n)
{
// Variables to store the values of the
// previous row of the DP table
int prev0 = 0, prev1 = -999999;
for (int i = 0; i <= n - 1; i++) {
int curr0 = max(prev0 + a[i], prev1 - a[i]);
int curr1 = max(prev0 - a[i], prev1 + a[i]);
// assigning values for further iterations
prev0 = curr0;
prev1 = curr1;
}
// Return the maximum sum
return prev0;
}
// Driver code
int main()
{
int a[] = { -10, 5, -4 };
int n = sizeof(a) / sizeof(a[0]);
cout << max_sum(a, n);
return 0;
}
// Java code for above approach
import java.util.*;
class Main {
// Function to return the maximum possible
// sum after performing the given operation
static int maxSum(int[] a, int n)
{
// Variables to store the values of the
// previous row of the DP table
int prev0 = 0, prev1 = -999999;
for (int i = 0; i <= n - 1; i++) {
int curr0 = Math.max(prev0 + a[i], prev1 - a[i]);
int curr1 = Math.max(prev0 - a[i], prev1 + a[i]);
// assigning values for further iterations
prev0 = curr0;
prev1 = curr1;
}
// Return the maximum sum
return prev0;
}
// Driver code
public static void main(String[] args)
{
int[] a = { -10, 5, -4 };
int n = a.length;
System.out.println(maxSum(a, n));
}
}
# Function to return the maximum possible sum after performing the given operation
def max_sum(a, n):
# Variables to store the values of the previous row of the DP table
prev0 = 0
prev1 = -999999
for i in range(n):
curr0 = max(prev0 + a[i], prev1 - a[i])
curr1 = max(prev0 - a[i], prev1 + a[i])
# assigning values for further iterations
prev0 = curr0
prev1 = curr1
# Return the maximum sum
return prev0
# Driver code
a = [-10, 5, -4]
n = len(a)
print(max_sum(a, n))
using System;
class MainClass
{
// Function to return the maximum possible
// sum after performing the given operation
static int maxSum(int[] a, int n)
{
// Variables to store the values of the
// previous row of the DP table
int prev0 = 0, prev1 = -999999;
for (int i = 0; i <= n - 1; i++)
{
int curr0 = Math.Max(prev0 + a[i], prev1 - a[i]);
int curr1 = Math.Max(prev0 - a[i], prev1 + a[i]);
// assigning values for further iterations
prev0 = curr0;
prev1 = curr1;
}
// Return the maximum sum
return prev0;
}
// Driver code
public static void Main()
{
int[] a = { -10, 5, -4 };
int n = a.Length;
Console.WriteLine(maxSum(a, n));
}
}
// Function to return the maximum possible
// sum after performing the given operation
function max_sum(a, n) {
// Variables to store the values of the
// previous row of the DP table
let prev0 = 0,
prev1 = -999999;
for (let i = 0; i <= n - 1; i++) {
let curr0 = Math.max(prev0 + a[i], prev1 - a[i]);
let curr1 = Math.max(prev0 - a[i], prev1 + a[i]);
// assigning values for further iterations
prev0 = curr0;
prev1 = curr1;
}
// Return the maximum sum
return prev0;
}
// Driver code
let a = [-10, 5, -4];
let n = a.length;
console.log(max_sum(a, n));
Time Complexity: O(N), as we are using a loop to traverse N times so it will cost us O(N) time.
Auxiliary Space: O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem