Given an array arr[] of length N, the task is to maximize the number of distinct elements in the array by performing either of the following operations, any number of times:
- For an index i(0 ≤ i < N), replace arr[i] with a and b such that arr[i] = a + b.
- For two indices i (0 ≤ i < N) and n (0 ≤ n < N), Replace arr[n] with (arr[i] + arr[n]). Pop arr[i] from the array.
Examples:
Input: arr[] = {1, 4, 2, 8}, N = 4
Output: 5
Explanation: arr[3] can be split into [3, 5] to form arr [] = {1, 4, 2, 3, 5}.
There is no other way to split this into more elements.Input: arr[] = {1, 1, 4, 3}, N = 4
Output: 3
Explanation: No operations can be performed to increase the number of distinct elements.
Approach: The problem can be based on the following observation:
Using the second operation, the entire arr[] can be reduced to 1 element, such that arr[0] = sum(arr[]). Now, the array sum can be partitioned into maximum number of unique parts get maximum unique elements.
Follow the below steps to implement the observation:
- Iterate over the array and find the sum of array elements (say sum).
- Now to get the maximum unique partitions of sum, it is optimal to assign as low a value as possible to each part.
- So, loop from i = 1 as long as sum > 0:
- Subtract i from sum and then increment i by 1.
- The total number of unique elements is i – 1, as there is an extra incrementation at the last iteration of the loop.
Below is the implementation of the above approach.
C++
// C++ code to implement the above approach#include <bits/stdc++.h>using namespace std;// Function to calculate the maximum possible// number of unique elementsint maxUniqueElems(int* Arr, int L){ // Initializing sums variable int sums = 0; // Calculating sum of array for (int j = 0; j < L; j++) sums += Arr[j]; // Initializing i to count total number of // distinct elements int i = 1; // Looping till sums becomes 0 while (sums > 0) { // Subtracting i from sums and // incrementing i sums -= i; i++; } // Returning the result return i - 1;}// Driver codeint main(){ int arr[] = { 1, 4, 2, 8 }; int N = 4; // Function call cout << maxUniqueElems(arr, N); return 0;} |
Java
// JAVA code to implement the above approachimport java.util.*;class GFG{ // Function to calculate the maximum possible // number of unique elements public static int maxUniqueElems(int []Arr, int L) { // Initializing sums variable int sums = 0; // Calculating sum of array for (int j = 0; j < L; j++) sums += Arr[j]; // Initializing i to count total number of // distinct elements int i = 1; // Looping till sums becomes 0 while (sums > 0) { // Subtracting i from sums and // incrementing i sums -= i; i++; } // Returning the result return i - 1; } // Driver code public static void main(String []args) { int arr[] = new int[]{ 1, 4, 2, 8 }; int N = 4; // Function call System.out.println(maxUniqueElems(arr, N)); }}// This code is contributed by Taranpreet |
Python3
# python3 code to implement the above approach# Function to calculate the maximum possible# number of unique elementsdef maxUniqueElems(Arr, L): # Initializing sums variable sums = 0 # Calculating sum of array for j in range(0, L): sums += Arr[j] # Initializing i to count total number of # distinct elements i = 1 # Looping till sums becomes 0 while (sums > 0): # Subtracting i from sums and # incrementing i sums -= i i += 1 # Returning the result return i - 1# Driver codeif __name__ == "__main__": arr = [1, 4, 2, 8] N = 4 # Function call print(maxUniqueElems(arr, N)) # This code is contributed by rakeshsahni |
Javascript
<script>// JavaScript code to implement the above approach// Function to calculate the maximum possible// number of unique elementsfunction maxUniqueElems(Arr, L){ // Initializing sums variable let sums = 0 // Calculating sum of array for(let j = 0; j < L; j++) sums += Arr[j] // Initializing i to count total number of // distinct elements let i = 1 // Looping till sums becomes 0 while (sums > 0){ // Subtracting i from sums and // incrementing i sums -= i i += 1 } // Returning the result return i - 1}// Driver codelet arr = [1, 4, 2, 8]let N = 4// Function calldocument.write(maxUniqueElems(arr, N),"</br>")// This code is contributed by shinjanpatra</script> |
C#
// C# code to implement the above approachusing System;class GFG { // Function to calculate the maximum possible // number of unique elements static int maxUniqueElems(int[] Arr, int L) { // Initializing sums variable int sums = 0; // Calculating sum of array for (int j = 0; j < L; j++) sums += Arr[j]; // Initializing i to count total number of // distinct elements int i = 1; // Looping till sums becomes 0 while (sums > 0) { // Subtracting i from sums and // incrementing i sums -= i; i++; } // Returning the result return i - 1; } // Driver code public static void Main() { int[] arr = { 1, 4, 2, 8 }; int N = 4; // Function call Console.WriteLine(maxUniqueElems(arr, N)); }}// This code is contributed by Samim Hossain Mondal. |
Output
5
Time Complexity: O(max(N, sqrt(S))) where S is the sum of array
Auxiliary Space: O(1)
Another Approach:
- First, the necessary header file is included using the #include preprocessor directive. The bits/stdc++.h header file includes all standard library header files, making it easier to write code.
- The maxUniqueElems() function takes an integer array (Arr) and its length (L) as input arguments.
- The variable “sums” is initialized to 0.
- The for loop is used to calculate the sum of all elements of the input array. It iterates over each element of the array using the loop variable “j”, and adds the value of the element to the “sums” variable.
- The next step is to calculate the total number of distinct elements in the input array. This is done using the formula: i = (sqrt(8*sums + 1) – 1) / 2 The formula is derived from the quadratic equation: n(n+1)/2 = sums, where n is the number of distinct elements. Solving the equation for n gives the above formula.
- Finally, the maxUniqueElems() function returns the value of “i”.
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>using namespace std;// Function to calculate the maximum possible// number of unique elementsint maxUniqueElems(int* Arr, int L){ // Initializing sums variable int sums = 0; // Calculating sum of array for (int j = 0; j < L; j++) sums += Arr[j]; // Initializing i to count total number of // distinct elements int i = (sqrt(8*sums + 1) - 1) / 2; // Returning the result return i;}// Driver codeint main(){ int arr[] = { 1, 4, 2, 8 }; int N = 4; // Function call cout << maxUniqueElems(arr, N); return 0;} |
Java
import java.util.*;public class Main { // Function to calculate the maximum possible // number of unique elements static int maxUniqueElems(int[] Arr, int L) { // Initializing sums variable int sums = 0; // Calculating sum of array for (int j = 0; j < L; j++) sums += Arr[j]; // Initializing i to count total number of // distinct elements int i = (int) ((Math.sqrt(8 * sums + 1) - 1) / 2); // Returning the result return i; } // Driver code public static void main(String[] args) { int[] arr = {1, 4, 2, 8}; int N = 4; // Function call System.out.println(maxUniqueElems(arr, N)); }} |
Python3
import math# Function to calculate the maximum possible# number of unique elementsdef maxUniqueElems(Arr, L): # Initializing sums variable sums = 0 # Calculating sum of array for j in range(L): sums += Arr[j] # Initializing i to count total number of # distinct elements i = (int(math.sqrt(8*sums + 1)) - 1) // 2 # Returning the result return i# Driver codeif __name__ == '__main__': arr = [1, 4, 2, 8] N = 4 # Function call print(maxUniqueElems(arr, N)) |
C#
using System;public class GFG { // Function to calculate the maximum possible // number of unique elements static int maxUniqueElems(int[] Arr, int L) { // Initializing sums variable int sums = 0; // Calculating sum of array for (int j = 0; j < L; j++) sums += Arr[j]; // Initializing i to count total number of // distinct elements int i = (int) ((Math.Sqrt(8 * sums + 1) - 1) / 2); // Returning the result return i; } // Driver code public static void Main() { int[] arr = {1, 4, 2, 8}; int N = 4; // Function call Console.Write(maxUniqueElems(arr, N)); }} |
Javascript
function maxUniqueElems(arr) { // Initializing sums variable let sums = 0; // Calculating sum of array for (let j = 0; j < arr.length; j++) { sums += arr[j]; } // Initializing i to count total number of distinct elements let i = Math.floor((Math.sqrt(8 * sums + 1) - 1) / 2); // Returning the result return i;}// Driver codeconst arr = [1, 4, 2, 8];console.log(maxUniqueElems(arr)); // Output: 3 |
Output
5
- In the main() function, an integer array arr[] is declared and initialized with some values.
- The length of the array is stored in the integer variable N.
- The maxUniqueElems() function is called with the array arr[] and its length N as input arguments.
- The output of the maxUniqueElems() function is printed to the console using the cout statement.
- The program ends with a return 0 statement.
Time Complexity: O(N)
Auxiliary Space: O(1)
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
