Find Array formed by adding each element of given array with largest element in new array to its left
Last Updated :
05 Nov, 2021
Given an array A of size N, the task is to find the resultant array formed by adding each element of the given array with the largest element in the new array to its left.
Examples:
Input: arr[] = {5, 1, 6, -3, 2}
Output: {5, 6, 12, 9, 14}
Element A0: No element if present at its left. Hence the element at 0th index of the resultant array = 5
Element A1: Largest element to its left in the resultant array = 5. Hence the element at 1th index of the resultant array = 1 + 5 = 6
Element A2: Largest element to its left in the resultant array = 6. Hence the element at 2nd index of the resultant array = 6 + 6 = 12
Element A3: Largest element to its left in the resultant array = 12. Hence the element at 3rd index of the result array = -3 + 12 = 9
Element A4: Largest element to its left in the resultant array = 12. Hence the element at 4th index of the result array = 2 + 12 = 14
Therefore the resultant array = {5, 6, 12, 9, 14}
Input: arr[] = {40, 12, 62}
Output: {40, 52, 114}
Approach:
In order to find such an array, each element of the new array will be computed one by one for each index in the range [0, N-1], according to the following rules:
- For the starting index, i.e. 0, the new array will be empty. Hence there won't be any largest element. In this case, the element at 0th index in the given array is copied down in the new array, i.e.
B0 = A0
where A is the given array and
B is the new array
2.For every other index in the range [1, N-1], first the largest element is found out to its left in the new array and then it is added to the corresponding element of the original array, i.e.,
Bi = Ai + max(B0, B1, ..., Bi-1)
where A is the given array,
B is the new array, and
i is the current index
Below is the implementation of the above approach:
C++
// C++ program to find Array formed by adding
// each element of given array with largest
// element in new array to its left
#include <bits/stdc++.h>
using namespace std;
// Function to find array B from array
// A such that Ai = Bi – max(B0…Bi-1)
void find_array(int a[], int n)
{
// Initialising as 0 as first
// element will remain same
int x = 0;
for (int i = 0; i < n; i++) {
// restoring values of B
a[i] += x;
cout << a[i] << ' ';
// Find max value
x = max(x, a[i]);
}
}
// Driver code
int main()
{
int a[] = {40, 12, 62};
int n = sizeof(a) / sizeof(a[0]);
// Function call
find_array(a, n);
return 0;
}
Java
// Java program to find Array formed by adding
// each element of given array with largest
// element in new array to its left
public class GFG
{
// Function to find array B from array
// A such that Ai = Bi – max(B0…Bi-1)
static void find_array(int []a, int n)
{
// Initialising as 0 as first
// element will remain same
int x = 0;
for (int i = 0; i < n; i++) {
// restoring values of B
a[i] += x;
System.out.print(a[i] + " ");
// Find max value
x = Math.max(x, a[i]);
}
}
// Driver code
public static void main(String []args)
{
int []a = {40, 12, 62};
int n = a.length ;
// Function call
find_array(a, n);
}
}
// This code is contributed by Yash_R
Python3
# Python3 program to find Array formed by adding
# each element of given array with largest
# element in new array to its left
# Function to find array B from array
# A such that Ai = Bi – max(B0…Bi-1)
def find_array(a, n) :
# Initialising as 0 as first
# element will remain same
x = 0;
for i in range(n) :
# restoring values of B
a[i] += x;
print(a[i],end= ' ');
# Find max value
x = max(x, a[i]);
# Driver code
if __name__ == "__main__" :
a = [40, 12, 62];
n = len(a);
# Function call
find_array(a, n);
# This code is contributed by Yash_R
C#
// C# program to find Array formed by adding
// each element of given array with largest
// element in new array to its left
using System;
class gfg
{
// Function to find array B from array
// A such that Ai = Bi – max(B0…Bi-1)
static void find_array(int []a, int n)
{
// Initialising as 0 as first
// element will remain same
int x = 0;
for (int i = 0; i < n; i++) {
// restoring values of B
a[i] += x;
Console.Write(a[i] + " ");
// Find max value
x = Math.Max(x, a[i]);
}
}
// Driver code
public static void Main(string []args)
{
int []a = {40, 12, 62};
int n = a.Length ;
// Function call
find_array(a, n);
}
}
// This code is contributed by Yash_R
JavaScript
<script>
// Javascript program to find Array formed by adding
// each element of given array with largest
// element in new array to its left
// Function to find array B from array
// A such that Ai = Bi – max(B0…Bi-1)
function find_array(a, n)
{
// Initialising as 0 as first
// element will remain same
let x = 0;
for (let i = 0; i < n; i++) {
// restoring values of B
a[i] += x;
document.write(a[i] + ' ');
// Find max value
x = Math.max(x, a[i]);
}
}
// Driver code
let a = [40, 12, 62];
let n = a.length;
// Function call
find_array(a, n);
// This code is contributed by Mayank Tyagi
</script>
Time Complexity: O(N)
Auxiliary Space: O(1)
Similar Reads
Maximum sum of Array formed by replacing each element with sum of adjacent elements Given an array arr[] of size N, the task is to find the maximum sum of the Array formed by replacing each element of the original array with the sum of adjacent elements.Examples: Input: arr = [4, 2, 1, 3] Output: 23 Explanation: Replacing each element of the original array with the sum of adjacent
9 min read
Find an element in array such that sum of left array is equal to sum of right array Given, an array of size n. Find an element that divides the array into two sub-arrays with equal sums. Examples: Input: 1 4 2 5 0Output: 2Explanation: If 2 is the partition, subarrays are : [1, 4] and [5] Input: 2 3 4 1 4 5Output: 1Explanation: If 1 is the partition, Subarrays are : [2, 3, 4] and [4
15+ min read
Largest element smaller than current element on left for every element in Array Given an array arr[] of the positive integers of size N, the task is to find the largest element on the left side of each index which is smaller than the element present at that index. Note: If no such element is found then print -1. Examples: Input: arr[] = {2, 5, 10} Output: -1 2 5 Explanation : I
11 min read
Modify array to another given array by replacing array elements with the sum of the array | Set-2 Given an Array input[] consisting only of 1s initially and an array target[] of size N, the task is to check if the array input[] can be converted to target[] by replacing input[i] with the sum of array elements in each step. Examples: Input: input[] = { 1, 1, 1 }, target[] = { 9, 3, 5 } Output: YES
10 min read
Maximize Array sum by adding multiple of another Array element in given ranges Given two arrays X[] and Y[] of length N along with Q queries each of type [L, R] that denotes the subarray of X[] from L to R. The task is to find the maximum sum that can be obtained by applying the following operation for each query: Choose an element from Y[]. Add multiples with alternate +ve an
15+ min read
Generate an array consisting of most frequent greater elements present on the right side of each array element Given an array A[] of size N, the task is to generate an array B[] based on the following conditions: For every array element A[i], find the most frequent element greater than A[i] present on the right of A[i]. Insert that element into B[].If more than one such element is present on the right, choos
9 min read
Maximize length of longest non-decreasing array possible by the elements present in either ends of the given array Given an array A[] of size N, the task is to find the maximum length of the longest non-decreasing array that can be generated from the given array by appending elements from either of the ends of the given array to the end of the resultant array and removing the appended element one by one. Example
11 min read
Minimize elements to be added to a given array such that it contains another given array as its subsequence | Set 2 Given an array A[] consisting of N distinct integers and another array B[] consisting of M integers, the task is to find the minimum number of elements to be added to the array B[] such that the array A[] becomes the subsequence of the array B[]. Examples: Input: N = 5, M = 6, A[] = {1, 2, 3, 4, 5},
9 min read
Minimize replacements of leftmost largest array element required to make all array elements equal Given an array arr[] consisting of N integers, the task is to make all array elements equal by replacing the leftmost largest element of the array with the largest element strictly smaller than the current maximum minimum number of times. Examples: Input: arr[] = { 1, 1, 2, 2, 3<}Output: 4Explana
6 min read
Rearrange the Array to maximize the elements which is smaller than both its adjacent elements Given an array arr[] consisting of N distinct integers, the task is to rearrange the array elements such that the count of elements that are smaller than their adjacent elements is maximum. Note: The elements left of index 0 and right of index N-1 are considered as -INF. Examples: Input: arr[] = {1,
7 min read