Find subsequences with maximum Bitwise AND and Bitwise OR

Given an array of n elements. The task is to print the maximum sum by selecting two subsequences of the array (not necessarily different) such that the sum of bitwise AND of all elements of the first subsequence and bitwise OR of all the elements of the second subsequence is maximum.

Examples:

Input: arr[] = {3, 5, 6, 1}
Output: 13
We get maximum AND value by choosing 6 only and maximum OR value by choosing all (3 | 5 | 6 | 1) = 7. So the result is 6 + 7 = 13.

Input: arr[] = {3, 3}
Output: 6

Approach: The maximum OR would be the or of all the numbers and the maximum AND would be the maximum element in the array. This is so because if (x | y) >= x, y and (x & y) <=x, y.

C++



filter_none

edit
close

play_arrow

link
brightness_4
code

//C++ implementation of above approach
#include<bits/stdc++.h>
  
using namespace std;
  
//function to find the maximum sum
void maxSum(int a[],int n)
{
    int maxAnd=0;
      
    //Maximum And is maximum element
    for(int i=0;i<n;i++)
        maxAnd=max(maxAnd,a[i]);
      
    //Maximum OR is bitwise OR of all
    int maxOR=0;
    for(int i=0;i<n;i++)
    {
        maxOR=maxOR|a[i];
    }
      
    cout<<maxAnd+maxOR;
}
  
//Driver code
int main()
{
    int a[]={3,5,6,1};
      
    int n=sizeof(a)/sizeof(a[0]);
      
    maxSum(a,n);
}
  
//This code is contributed by Mohit kumar 29

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

import java.util.Arrays;
  
// Java implementation of the above approach
// Function to find the maximum sum
class GFG {
  
    static void maxSum(int[] a, int n) {
  
        // Maximum AND is maximum element
        int maxAnd = Arrays.stream(a).max().getAsInt();
  
        // Maximum OR is bitwise OR of all.
        int maxOR = 0;
        for (int i = 0; i < n; i++) {
            maxOR |= a[i];
        }
        System.out.println((maxAnd + maxOR));
  
// Driver code
    }
  
    public static void main(String[] args) {
  
        int n = 4;
        int[] a = {3, 5, 6, 1};
        maxSum(a, n);
    }
}
  
//This code contributed by 29AjayKumar

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python implementation of the above approach
  
# Function to find the maximum sum
def maxSum(a, n):
  
    # Maximum AND is maximum element
    maxAnd = max(a)
  
    # Maximum OR is bitwise OR of all.
    maxOR = 0
    for i in range(n):
        maxOR|= a[i]
          
    print(maxAnd + maxOR)
  
# Driver code
n = 4
a = [3, 5, 6, 1]
maxSum(a, n)

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# implementation of the above approach
  
using System;
using System.Linq;
public class GFG {
       
    // Function to find the maximum sum
    static void maxSum(int []a, int n) {
   
        // Maximum AND is maximum element
        int maxAnd = a.Max();
        // Maximum OR is bitwise OR of all.
        int maxOR = 0;
        for (int i = 0; i < n; i++) {
            maxOR |= a[i];
        }
        Console.Write((maxAnd + maxOR));
   
// Driver code
    }
   
    public static void Main() {
   
        int n = 4;
        int[] a = {3, 5, 6, 1};
        maxSum(a, n);
    }
}
   
//This code contributed by 29AjayKumar

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP implementation of the 
// above approach
  
// Function to find the maximum sum
function maxSum($a, $n)
{
  
    // Maximum AND is maximum element
    $maxAnd = max($a);
  
    // Maximum OR is bitwise OR of all.
    $maxOR = 0;
    for($i = 0; $i < $n; $i++)
        $maxOR|= $a[$i];
          
    print($maxAnd + $maxOR);
}
  
// Driver code
$n = 4;
$a = array(3, 5, 6, 1);
maxSum($a, $n);
  
// This code is contributed by mits
?>

chevron_right


Output:

13


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.