Minimum increment/decrement to make array non-Increasing
Last Updated :
16 Feb, 2023
Given an array a, your task is to convert it into a non-increasing form such that we can either increment or decrement the array value by 1 in the minimum changes possible.
Examples :
Input : a[] = {3, 1, 2, 1}
Output : 1
Explanation : We can convert the array into 3 1 1 1 by changing 3rd element of array i.e. 2 into its previous integer 1 in one step hence only one step is required.
Input : a[] = {3, 1, 5, 1}
Output : 4
Explanation : We need to decrease 5 to 1 to make array sorted in non-increasing order.
Input : a[] = {1, 5, 5, 5}
Output : 4
Explanation : We need to increase 1 to 5.
Brute-Force approach: We consider both possibilities for every element and find a minimum of two possibilities.
Efficient Approach Method 1 (Using Min-Heap):
Calculate the sum of absolute differences between the final array elements and the current array elements. Thus, the answer will be the sum of the difference between the ith element and the smallest element that occurred until then. For this, we can maintain a min-heap to find the smallest element encountered till then. In the min-priority queue, we will put the elements, and new elements are compared with the previous minimum. If the new minimum is found we will update it, this is done because each of the next elements which are coming should be smaller than the current minimum element found till now. Here, we calculate the difference so that we can get how much we have to change the current number so that it will be equal or less than previous numbers encountered. Lastly, the sum of all these differences will be our answer as this will give the final value up to which we have to change the elements.
Below is the implementation of the above approach:
C++14
// CPP code to count the change required to
// convert the array into non-increasing array
#include <bits/stdc++.h>
using namespace std;
int DecreasingArray(int a[], int n)
{
int sum = 0, dif = 0;
// min heap
priority_queue<int, vector<int>, greater<int> > pq;
// Here in the loop we will check that whether
// the top of priority queue is less than
// the upcoming array element. If yes then
// we calculate the difference. After that
// we will remove that element and push the
// current element in queue. And the sum
// is incremented by the value of difference
for (int i = 0; i < n; i++) {
if (!pq.empty() && pq.top() < a[i]) {
dif = a[i] - pq.top();
sum += dif;
// Removing that minimum element
// which does follow the decreasing
// property and replacing it with a[i]
// to maintain the condition
pq.pop();
pq.push(a[i]);
}
// Push the current element as well
pq.push(a[i]);
}
return sum;
}
// Driver Code
int main()
{
int a[] = { 3, 1, 2, 1 };
int n = sizeof(a) / sizeof(a[0]);
cout << DecreasingArray(a, n);
return 0;
}
// Java code to count the change required to
// convert the array into non-increasing array
import java.util.PriorityQueue;
class GFG
{
public static int DecreasingArray(int a[], int n)
{
int sum = 0, dif = 0;
PriorityQueue<Integer> pq = new PriorityQueue<>();
// Here in the loop we will
// check that whether the upcoming
// element of array is less than top
// of priority queue. If yes then we
// calculate the difference. After
// that we will remove that element
// and push the current element in
// queue. And the sum is incremented
// by the value of difference
for (int i = 0; i < n; i++)
{
if (!pq.isEmpty() && pq.element() < a[i])
{
dif = a[i] - pq.element();
sum += dif;
pq.remove();
pq.add(a[i]);
}
pq.add(a[i]);
}
return sum;
}
// Driver Code
public static void main(String[] args)
{
int[] a = {3, 1, 2, 1};
int n = a.length;
System.out.println(DecreasingArray(a, n));
}
}
// This Code is contributed by sanjeev2552
# Python3 code to count the change required to
# convert the array into non-increasing array
from queue import PriorityQueue
def DecreasingArray(a, n):
ss, dif = (0,0)
# min heap
pq = PriorityQueue()
# Here in the loop we will
# check that whether the upcoming
# element of array is less than top
# of priority queue. If yes then we
# calculate the difference. After
# that we will remove that element
# and push the current element in
# queue. And the sum is incremented
# by the value of difference
for i in range(n):
tmp = 0
if not pq.empty():
tmp = pq.get()
pq.put(tmp)
if not pq.empty() and tmp < a[i]:
dif = a[i] - tmp
ss += dif
pq.get()
pq.put(a[i])
pq.put(a[i])
return ss
# Driver code
if __name__=="__main__":
a = [ 3, 1, 2, 1 ]
n = len(a)
print(DecreasingArray(a, n))
# This code is contributed by rutvik_56
// C# code to count the change required to
// convert the array into non-increasing array
using System;
using System.Collections.Generic;
class GFG
{
static int DecreasingArray(int[] a, int n)
{
int sum = 0, dif = 0;
// min heap
List<int> pq = new List<int>();
// Here in the loop we will
// check that whether the upcoming
// element of array is less than top
// of priority queue. If yes then we
// calculate the difference. After
// that we will remove that element
// and push the current element in
// queue. And the sum is incremented
// by the value of difference
for (int i = 0; i < n; i++)
{
if (pq.Count > 0 && pq[0] < a[i])
{
dif = a[i] - pq[0];
sum += dif;
pq.RemoveAt(0);
pq.Add(a[i]);
}
pq.Add(a[i]);
pq.Sort();
}
return sum;
}
// Driver code
static void Main()
{
int[] a = { 3, 1, 2, 1 };
int n = a.Length;
Console.Write(DecreasingArray(a, n));
}
}
// This code is contributed by divyeshrabadiya07.
<script>
// Javascript code to count the change required to
// convert the array into non-increasing array
function DecreasingArray(a, n)
{
var sum = 0, dif = 0;
// min heap
var pq = [];
// Here in the loop we will
// check that whether the upcoming
// element of array is less than top
// of priority queue. If yes then we
// calculate the difference. After
// that we will remove that element
// and push the current element in
// queue. And the sum is incremented
// by the value of difference
for (var i = 0; i < n; i++)
{
if (pq.length != 0 && pq[pq.length - 1] < a[i]) {
dif = a[i] - pq[pq.length - 1];
sum += dif;
pq.pop();
pq.push(a[i]);
}
pq.push(a[i]);
pq.sort((a, b)=>b - a);
}
return sum;
}
// Driver Code
var a = [3, 1, 2, 1];
var n = a.length;
document.write(DecreasingArray(a, n));
// This code is contributed by rrrtnx.
</script>
Complexity Analysis:
- Time Complexity: O(n log(n))
- Auxiliary Space: O(n)
Method 2: Using Max-Heap:
Traverse in reverse order in the given array and keep maintaining the increasing property. If any element is smaller than the maximum of existing elements till that index then, we need to make some decrement operation on that maximum element so that it also follows the increasing property from back traversal and add the required operation in the answer.
Implementation:
C++
// CPP code to count the change required to
// convert the array into non-increasing array
#include <bits/stdc++.h>
using namespace std;
int DecreasingArray(int arr[], int n)
{
int ans = 0;
// max heap
priority_queue<int> pq;
// Here in the loop we will
// check that whether the top
// of priority queue is greater than the upcoming array
// element. If yes then we calculate the difference.
// After that we will remove that element and push the
// current element in queue. And the sum is incremented
// by the value of difference
for (int i = n - 1; i >= 0; i--) {
if (!pq.empty() and pq.top() > arr[i]) {
ans += abs(arr[i] - pq.top());
pq.pop();
pq.push(arr[i]);
}
pq.push(arr[i]);
}
return ans;
}
// Driver Code
int main()
{
int a[] = { 3, 1, 2, 1 };
int n = sizeof(a) / sizeof(a[0]);
cout << DecreasingArray(a, n);
return 0;
}
// Java code to count the change required to
// convert the array into non-increasing array
import java.io.*;
import java.util.*;
class GFG {
public static int DecreasingArray(int arr[], int n)
{
int ans = 0;
// max heap
PriorityQueue<Integer> pq = new PriorityQueue<>(
Collections.reverseOrder());
// Here in the loop we will
// check that whether the top
// of priority queue is greater than the upcoming
// array element. If yes then we calculate the
// difference. After that we will remove that
// element and push the current element in queue.
// And the sum is incremented by the value of
// difference
for (int i = n - 1; i >= 0; i--) {
if (!pq.isEmpty() && pq.peek() > arr[i]) {
ans += Math.abs(arr[i] - pq.peek());
pq.poll();
pq.add(arr[i]);
}
pq.add(arr[i]);
}
return ans;
}
// Driver Code
public static void main(String[] args)
{
int a[] = { 3, 1, 2, 1 };
int n = a.length;
System.out.print(DecreasingArray(a, n));
}
}
// This code is contributed by Rohit Pradhan
# Python code to count the change required to
# convert the array into non-increasing array
def DecreasingArray(arr, n):
ans = 0
# max heap
pq = []
# Here in the loop we will
# check that whether the top
# of priority queue is greater than the upcoming array
# element. If yes then we calculate the difference.
# After that we will remove that element and push the
# current element in queue. And the sum is incremented
# by the value of difference
for i in range(n - 1, -1, -1):
if pq and pq[0] > arr[i]:
ans += abs(arr[i] - pq[0])
pq.pop(0)
pq.insert(0, arr[i])
pq.insert(0, arr[i])
return ans
# Driver Code
a = [3, 1, 2, 1]
n = len(a)
print(DecreasingArray(a, n))
# This code is contributed by phasing17.
// C# code to count the change required to
// convert the array into non-increasing array
using System;
using System.Collections;
using System.Collections.Generic;
public class GFG {
public static int DecreasingArray(int[] arr, int n)
{
int ans = 0;
// max heap
SortedSet<int> pq = new SortedSet<int>();
// Here in the loop we will
// check that whether the top
// of priority queue is greater than the upcoming
// array element. If yes then we calculate the
// difference. After that we will remove that
// element and push the current element in queue.
// And the sum is incremented by the value of
// difference
for (int i = n - 1; i >= 0; i--) {
if (pq.Count > 0 && pq.Max > arr[i]) {
ans += Math.Abs(arr[i] - pq.Max);
pq.Remove(pq.Max);
pq.Add(arr[i]);
}
pq.Add(arr[i]);
}
return ans;
}
static public void Main()
{
// Code
int[] a = { 3, 1, 2, 1 };
int n = a.Length;
Console.WriteLine(DecreasingArray(a, n));
}
}
// This code is contributed by lokeshmvs21.
// JS code to count the change required to
// convert the array into non-increasing array
function DecreasingArray(arr, n) {
let ans = 0;
// max heap
let pq = [];
// Here in the loop we will
// check that whether the top
// of priority queue is greater than the upcoming array
// element. If yes then we calculate the difference.
// After that we will remove that element and push the
// current element in queue. And the sum is incremented
// by the value of difference
for (let i = n - 1; i >= 0; i--) {
if (pq.length != 0 && pq[0] > arr[i]) {
ans += Math.abs(arr[i] - pq[0]);
pq.pop();
pq.unshift(arr[i]);
}
pq.unshift(arr[i]);
}
return ans;
}
// Driver Code
let a = [3, 1, 2, 1];
let n = a.length;
console.log(DecreasingArray(a, n));
// This code is contributed by ishankhandelwals.
Complexity Analysis:
- Time Complexity: O(n log(n))
- Auxiliary Space: O(n)
Also see : Convert to strictly increasing array with minimum changes.
Similar Reads
Greedy Algorithms Greedy 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
Greedy Algorithm Tutorial Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit. Greedy algorithms are used for optimization problems. An optimization problem can be solved using Greedy if the problem has the following pro
9 min read
Greedy Algorithms General Structure A greedy algorithm solves problems by making the best choice at each step. Instead of looking at all possible solutions, it focuses on the option that seems best right now.Example of Greedy Algorithm - Fractional KnapsackProblem structure:Most of the problems where greedy algorithms work follow thes
5 min read
Difference between Greedy Algorithm and Divide and Conquer Algorithm Greedy algorithm and divide and conquer algorithm are two common algorithmic paradigms used to solve problems. The main difference between them lies in their approach to solving problems. Greedy Algorithm:The greedy algorithm is an algorithmic paradigm that follows the problem-solving heuristic of m
3 min read
Greedy Approach vs Dynamic programming Greedy approach and Dynamic programming are two different algorithmic approaches that can be used to solve optimization problems. Here are the main differences between these two approaches: Greedy Approach:The greedy approach makes the best choice at each step with the hope of finding a global optim
2 min read
Comparison among Greedy, Divide and Conquer and Dynamic Programming algorithm Greedy algorithm, divide and conquer algorithm, and dynamic programming algorithm are three common algorithmic paradigms used to solve problems. Here's a comparison among these algorithms:Approach:Greedy algorithm: Makes locally optimal choices at each step with the hope of finding a global optimum.
4 min read
Standard Greedy algorithms
Activity Selection Problem | Greedy Algo-1Given n activities with start times in start[] and finish times in finish[], find the maximum number of activities a single person can perform without overlap. A person can only do one activity at a time. Examples: Input: start[] = [1, 3, 0, 5, 8, 5], finish[] = [2, 4, 6, 7, 9, 9]Output: 4Explanatio
13 min read
Job Sequencing ProblemGiven two arrays: deadline[] and profit[], where the index of deadline[] represents a job ID, and deadline[i] denotes the deadline for that job and profit[i] represents profit of doing ith job. Each job takes exactly one unit of time to complete, and only one job can be scheduled at a time. A job ea
13 min read
Huffman Coding | Greedy Algo-3Huffman coding is a lossless data compression algorithm. The idea is to assign variable-length codes to input characters, lengths of the assigned codes are based on the frequencies of corresponding characters. The variable-length codes assigned to input characters are Prefix Codes, means the codes (
12 min read
Huffman DecodingWe have discussed Huffman Encoding in a previous post. In this post, decoding is discussed. Examples: Input Data: AAAAAABCCCCCCDDEEEEEFrequencies: A: 6, B: 1, C: 6, D: 2, E: 5 Encoded Data: 0000000000001100101010101011111111010101010 Huffman Tree: '#' is the special character usedfor internal nodes
15 min read
Water Connection ProblemYou are given n houses in a colony, numbered from 1 to n, and p pipes connecting these houses. Each house has at most one outgoing pipe and at most one incoming pipe. Your goal is to install tanks and taps efficiently.A tank is installed at a house that has one outgoing pipe but no incoming pipe.A t
8 min read
Greedy Algorithm for Egyptian FractionEvery positive fraction can be represented as sum of unique unit fractions. A fraction is unit fraction if numerator is 1 and denominator is a positive integer, for example 1/3 is a unit fraction. Such a representation is called Egyptian Fraction as it was used by ancient Egyptians. Following are a
11 min read
Policemen catch thievesGiven an array arr, where each element represents either a policeman (P) or a thief (T). The objective is to determine the maximum number of thieves that can be caught under the following conditions:Each policeman (P) can catch only one thief (T).A policeman can only catch a thief if the distance be
12 min read
Fitting Shelves ProblemGiven length of wall w and shelves of two lengths m and n, find the number of each type of shelf to be used and the remaining empty space in the optimal solution so that the empty space is minimum. The larger of the two shelves is cheaper so it is preferred. However cost is secondary and first prior
9 min read
Assign Mice to HolesThere are N Mice and N holes are placed in a straight line. Each hole can accommodate only 1 mouse. A mouse can stay at his position, move one step right from x to x + 1, or move one step left from x to x -1. Any of these moves consumes 1 minute. Assign mice to holes so that the time when the last m
8 min read
Greedy algorithm on Array
Minimum product subset of an arrayINTRODUCTION: The minimum product subset of an array refers to a subset of elements from the array such that the product of the elements in the subset is minimized. To find the minimum product subset, various algorithms can be used, such as greedy algorithms, dynamic programming, and branch and boun
13 min read
Maximize array sum after K negations using SortingGiven an array of size n and an integer k. We must modify array k number of times. In each modification, we can replace any array element arr[i] by -arr[i]. The task is to perform this operation in such a way that after k operations, the sum of the array is maximum.Examples : Input : arr[] = [-2, 0,
10 min read
Minimum sum of product of two arraysFind the minimum sum of Products of two arrays of the same size, given that k modifications are allowed on the first array. In each modification, one array element of the first array can either be increased or decreased by 2.Examples: Input : a[] = {1, 2, -3} b[] = {-2, 3, -5} k = 5 Output : -31 Exp
14 min read
Minimum sum of absolute difference of pairs of two arraysGiven two arrays a[] and b[] of equal length n. The task is to pair each element of array a to an element in array b, such that sum S of absolute differences of all the pairs is minimum.Suppose, two elements a[i] and a[j] (i != j) of a are paired with elements b[p] and b[q] of b respectively, then p
7 min read
Minimum increment/decrement to make array non-IncreasingGiven an array a, your task is to convert it into a non-increasing form such that we can either increment or decrement the array value by 1 in the minimum changes possible. Examples : Input : a[] = {3, 1, 2, 1}Output : 1Explanation : We can convert the array into 3 1 1 1 by changing 3rd element of a
11 min read
Sorting array with reverse around middleConsider the given array arr[], we need to find if we can sort array with the given operation. The operation is We have to select a subarray from the given array such that the middle element(or elements (in case of even number of elements)) of subarray is also the middle element(or elements (in case
6 min read
Sum of Areas of Rectangles possible for an arrayGiven an array, the task is to compute the sum of all possible maximum area rectangles which can be formed from the array elements. Also, you can reduce the elements of the array by at most 1. Examples: Input: a = {10, 10, 10, 10, 11, 10, 11, 10} Output: 210 Explanation: We can form two rectangles o
13 min read
Largest lexicographic array with at-most K consecutive swapsGiven an array arr[], find the lexicographically largest array that can be obtained by performing at-most k consecutive swaps. Examples : Input : arr[] = {3, 5, 4, 1, 2} k = 3 Output : 5, 4, 3, 2, 1 Explanation : Array given : 3 5 4 1 2 After swap 1 : 5 3 4 1 2 After swap 2 : 5 4 3 1 2 After swap 3
9 min read
Partition into two subsets of lengths K and (N - k) such that the difference of sums is maximumGiven an array of non-negative integers of length N and an integer K. Partition the given array into two subsets of length K and N - K so that the difference between the sum of both subsets is maximum. Examples : Input : arr[] = {8, 4, 5, 2, 10} k = 2 Output : 17 Explanation : Here, we can make firs
7 min read
Greedy algorithm on Operating System
Program for First Fit algorithm in Memory ManagementPrerequisite : Partition Allocation MethodsIn the first fit, the partition is allocated which is first sufficient from the top of Main Memory.Example : Input : blockSize[] = {100, 500, 200, 300, 600}; processSize[] = {212, 417, 112, 426};Output:Process No. Process Size Block no. 1 212 2 2 417 5 3 11
8 min read
Program for Best Fit algorithm in Memory ManagementPrerequisite : Partition allocation methodsBest fit allocates the process to a partition which is the smallest sufficient partition among the free available partitions. Example: Input : blockSize[] = {100, 500, 200, 300, 600}; processSize[] = {212, 417, 112, 426}; Output: Process No. Process Size Bl
8 min read
Program for Worst Fit algorithm in Memory ManagementPrerequisite : Partition allocation methodsWorst Fit allocates a process to the partition which is largest sufficient among the freely available partitions available in the main memory. If a large process comes at a later stage, then memory will not have space to accommodate it. Example: Input : blo
8 min read
Program for Shortest Job First (or SJF) CPU Scheduling | Set 1 (Non- preemptive)The shortest job first (SJF) or shortest job next, is a scheduling policy that selects the waiting process with the smallest execution time to execute next. SJN, also known as Shortest Job Next (SJN), can be preemptive or non-preemptive. Â Characteristics of SJF Scheduling: Shortest Job first has th
13 min read
Job Scheduling with two jobs allowed at a timeGiven a 2d array jobs[][] of order n * 2, where each element jobs[i], contains two integers, representing the start and end time of the job. Your task is to check if it is possible to complete all the jobs, provided that two jobs can be done simultaneously at a particular moment. Note: If a job star
6 min read
Optimal Page Replacement AlgorithmIn operating systems, whenever a new page is referred and not present in memory, page fault occurs, and Operating System replaces one of the existing pages with newly needed page. Different page replacement algorithms suggest different ways to decide which page to replace. The target for all algorit
3 min read
Greedy algorithm on Graph