Find the remaining Array element after adding values in given ranges
Last Updated :
14 Nov, 2022
Given an array A[] containing N elements and an array queries containing Q queries of type [ X, L, R ] where X is the element to be added to all the elements in the range [L, R]. After performing all Q queries keep on removing two array elements and append their sum into the array till the array size becomes 1. The task is to find this remaining array element.
Note: 1-based indexing is considered.
Example:
Input: A[] = [ 1, 4, 3, 2, 4 ], queries = [ [5, 1, 2 ], [ -5, 1, 3 ] ]
Output: 9
Explanation:
1st query: Adding 5 to the first and second element, A becomes {6, 9, 3, 2, 4}.
2nd query: Adding -5 to first, second and third element, A becomes {1, 4, -2, 2, 4}.
Operation 1: Select A1=1 and A3 = -2, remove them and
add their sum (1-2=-1) to the array, A becomes {4, 2, 4, -1}.
Operation 2: Select A2=2 and A3 = -1, remove them and
add their sum (2-1=1) to the array, A becomes {4, 4, 1}.
Operation 3: Select A1=4 and A3=1, remove them and
add their sum (4+1=5) to the array, A becomes {4, 5}.
Operation 4: Select the remaining two elements and
add their sum (4+5 = 9) to the array, A becomes {9}.
Input: A = [1, 2, 3], queries = [ [-3, 1, 3 ] ]
Output: -3
Naive Approach:
First calculate the array A for all Q queries by traversing them and adding queries[i][0] from queries[i][1]-1 to queries[i][2]-1.
Then the selection of the elements has to be random but it is important to note that any pair of elements (Ai and Aj) we remove and add its sum ( Ai + Aj ) as new element, we are confirmed to get the sum of the array A as the final remaining element due to the summation property mentioned below:
Sn (sum) = (A1 + A2) + A3 + A4 + . . . + An
Sn = (S12 + A3) + A4 + . . . + An
Sn = (S123 + A4)+ . . . + An
. . . . .
Sn = S123...n
Follow the below illustration for a better understanding
Illustration:
Consider an example A = [a1, a2, a3] and queries = [[x1, 1, 2], [x2, 1, 3]]
1st query:
Adding x1 to the first and second element,
the array A becomes [ a1 + x1, a2 + x1, a3] .
new a1 = a1 + x1
new a2 = a2 + x1
2nd query:
Adding x2 to first, second and third element,
the array A becomes [ a1 + x2, a2 + x2, a3 + x2] .
new a1 = a1 + x2
new a2 = a2 + x2
new a3 = a3 + x2
Operation 1:
Select a1 and a3, remove them and add their sum (a1 + a3) to array,
A becomes [a2, (a1 + a3)].
previous a2 become a1 and the added sum will became a2.
Operation 2:
Select a1 and a2, remove them and add their sum (a1 + a2) to array,
A becomes [a1 + a2 + a3]
Follow the steps mentioned below to implement the idea:
- Traverse for all Q queries (say i).
- Traverse from queries[i][1]-1 to queries[i][2]-1 (say j).
- Add queries[i][0] to all array elements in the range.
- After all the loops are over, Traverse the array A[] to find the sum of it and store it in result.
- Return result as the final answer.
Below is the implementation of the above approach :
C++14
// C++ code to implement the approach
#include <bits/stdc++.h>
using namespace std;
// Function to find the value of the remaining element
int randomize(vector<int>& A, int& N,
vector<vector<int> >& queries, int& Q)
{
int result = 0;
// Loop to perform the queries
for (int i = 0; i < Q; i++) {
for (int j = queries[i][1] - 1;
j < queries[i][2]; j++)
A[j] += queries[i][0];
}
// Loop to find the sum of the array
for (int i = 0; i < N; i++)
result += A[i];
return result;
}
// Driver code
int main()
{
vector<int> A = { 1, 4, 3, 2, 4 };
int N = A.size();
vector<vector<int> > queries
= { { 5, 1, 2 }, { -5, 1, 3 } };
int Q = queries.size();
// Function call
cout << randomize(A, N, queries, Q);
return 0;
}
// Java code to implement the approach
import java.io.*;
class GFG {
// Function to find the value of the remaining element
static int randomize(int[] A, int N, int[][] queries,
int Q)
{
int result = 0;
// Loop to perform the queries
for (int i = 0; i < Q; i++) {
for (int j = queries[i][1] - 1;
j < queries[i][2]; j++) {
A[j] += queries[i][0];
}
}
// Loop to find the sum of the array
for (int i = 0; i < N; i++) {
result += A[i];
}
return result;
}
public static void main(String[] args)
{
int[] A = { 1, 4, 3, 2, 4 };
int N = A.length;
int[][] queries = { { 5, 1, 2 }, { -5, 1, 3 } };
int Q = queries.length;
// Function call
System.out.print(randomize(A, N, queries, Q));
}
}
// This code is contributed by lokeshmvs21.
# Python code to implement the approach
# Function to find the value of the remaining element
def randomize( A, N, queries, Q) :
result = 0
# Loop to perform the queries
for i in range(0, Q):
for j in range(queries[i][1] - 1, queries[i][2], 1):
A[j] += queries[i][0]
# Loop to find the sum of the array
for i in range(N):
result += A[i]
return result
# Driver code
if __name__ == "__main__":
A = [ 1, 4, 3, 2, 4 ]
N = len(A)
queries = [[ 5, 1, 2 ], [ -5, 1, 3 ]]
Q = len(queries)
# Function call
print( randomize(A, N, queries, Q))
# This code is contributed by code_hunt.
// C# code to implement the approach
using System;
class GFG {
// Function to find the value of the remaining element
static int randomize(int[] A, int N, int[,] queries,
int Q)
{
int result = 0;
// Loop to perform the queries
for (int i = 0; i < Q; i++) {
for (int j = queries[i,1] - 1;
j < queries[i,2]; j++) {
A[j] += queries[i,0];
}
}
// Loop to find the sum of the array
for (int i = 0; i < N; i++) {
result += A[i];
}
return result;
}
public static void Main(string[] args)
{
int[] A = { 1, 4, 3, 2, 4 };
int N = A.Length;
int[,] queries = { { 5, 1, 2 }, { -5, 1, 3 } };
int Q = queries.GetLength(0);
// Function call
Console.WriteLine(randomize(A, N, queries, Q));
}
}
// This code is contributed by AnkThon
<script>
// Javascriptcode to implement the approach
// Function to find the value of the remaining element
function randomize( A, N,
queries, Q)
{
let result = 0;
// Loop to perform the queries
for (let i = 0; i < Q; i++) {
for (let j = queries[i][1] - 1;
j < queries[i][2]; j++)
A[j] += queries[i][0];
}
// Loop to find the sum of the array
for (let i = 0; i < N; i++)
result += A[i];
return result;
}
// Driver code
let A = [ 1, 4, 3, 2, 4 ];
let N = A.length;
let queries
= [ [ 5, 1, 2 ], [ -5, 1, 3 ] ];
let Q = queries.length;
// Function call
document.write(randomize(A, N, queries, Q));
// This code is contributed by satwik4409.
</script>
Time Complexity: O(Q*M + N) where M is the maximum range among the queries
Auxiliary Space: O(1)
Efficient Approach: The problem can also be solved efficiently by reducing the time requirement of query updates. The idea is as follows.
If we see clearly, we can find our answer by doing things backward.
- First we add all the elements present in A into a element ans and then,
- Add the elements present in queries to the range which is provided with it, i.e., simply add the queries [i]*((L-R)+1) to ans rather than applying it to the given range [L, R].
Follow the steps given below:
- Traverse A and add all the elements present in it.
- Traverse queries and add queries[i][0] * ((queries[i][1]-queries[i][2])+1) to the sum.
- Return the sum as the required answer.
Below is the implementation of the above approach :
C++14
// C++ code to implement the approach
#include <bits/stdc++.h>
using namespace std;
// Function to find the remaining value
int solve(vector<int>& v,
vector<vector<int> >& queries)
{
int ans = 0;
// Loop to calculate the array sum
for (int i = 0; i < v.size(); i++) {
ans += v[i];
}
// Loop to process the queries
for (int i = 0; i < queries.size(); i++) {
int temp = abs(queries[i][1] - queries[i][2]) + 1;
ans += queries[i][0] * temp;
}
return ans;
}
// Driver code
int main()
{
vector<int> A = { 1, 4, 3, 2, 4 };
int N = A.size();
vector<vector<int> > queries
= { { 5, 1, 2 }, { -5, 1, 3 } };
// Function call
cout << solve(A, queries);
return 0;
}
// Java code to implement the approach
import java.io.*;
class GFG {
// Function to find the remaining value
public static int solve(int v[], int queries[][])
{
int ans = 0;
// Loop to calculate the array sum
for (int i = 0; i < v.length; i++) {
ans += v[i];
}
// Loop to process the queries
for (int i = 0; i < queries.length; i++) {
int temp
= Math.abs(queries[i][1] - queries[i][2])
+ 1;
ans += queries[i][0] * temp;
}
return ans;
}
// Driver Code
public static void main(String[] args)
{
int A[] = { 1, 4, 3, 2, 4 };
int N = A.length;
int queries[][] = { { 5, 1, 2 }, { -5, 1, 3 } };
// Function call
System.out.print(solve(A, queries));
}
}
// This code is contributed by Rohit Pradhan
# python code to implement the approach
# Function to find the remaining value
def solve(v, queries):
ans = 0
# Loop to calculate the array sum
for i in range(len(v)):
ans = ans + v[i]
# Loop to process the queries
for i in range(len(queries)):
temp = abs(queries[i][1] - queries[i][2]) + 1
ans = ans + (queries[i][0] * temp)
return ans
# Driver code
A = [1, 4, 3, 2, 4]
N = len(A)
queries = [[5, 1, 2 ],[-5, 1, 3 ]]
# Function call
print (solve(A,queries))
# This code is contributed by Atul_kumar_Shrivastava
// C# code to implement the approach
using System;
public class GFG {
// Function to find the remaining value
public static int solve(int []v, int [,]queries)
{
int ans = 0;
// Loop to calculate the array sum
for (int i = 0; i < v.Length; i++) {
ans += v[i];
}
// Loop to process the queries
for (int i = 0; i < queries.GetLength(0); i++) {
int temp
= Math.Abs(queries[i,1] - queries[i,2])
+ 1;
ans += queries[i,0] * temp;
}
return ans;
}
// Driver Code
public static void Main(string[] args)
{
int []A = { 1, 4, 3, 2, 4 };
int N = A.Length;
int [,]queries = { { 5, 1, 2 }, { -5, 1, 3 } };
// Function call
Console.WriteLine(solve(A, queries));
}
}
// This code is contributed by AnkThon
<script>
// JavaScript code for the above approach
// Function to find the remaining value
function solve(v, queries)
{
let ans = 0;
// Loop to calculate the array sum
for (let i = 0; i < v.length; i++) {
ans += v[i];
}
// Loop to process the queries
for (let i = 0; i < queries.length; i++) {
let temp
= Math.abs(queries[i][1] - queries[i][2])
+ 1;
ans += queries[i][0] * temp;
}
return ans;
}
// Driver Code
let A = [ 1, 4, 3, 2, 4 ];
let N = A.length;
let queries = [[ 5, 1, 2 ], [ -5, 1, 3 ]];
// Function call
document.write(solve(A, queries));
</script>
Time Complexity: O(N + Q)
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