AND xor OR
Problem Statement :
Given an array of distinct elements. Let and be the smallest and the next smallest element in the interval where . . where , are the bitwise operators , and respectively. Your task is to find the maximum possible value of . Input Format First line contains integer N. Second line contains N integers, representing elements of the array A[] . Output Format Print the value of maximum possible value of Si.
Solution :
Solution in C :
In C ++ :
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <stack>
using namespace std;
int main() {
int n;
cin>>n;
int * arr;
arr = new int[n];
for(int i=0;i<n;i++)cin>>arr[i];
stack<int> S;
int m = 0;
for(int i=0;i<n;i++)
{
while(true)
{
if(S.empty())
{
S.push(arr[i]);
break;
}
else if(S.top() < arr[i] )
{
m = max(m, S.top()^arr[i]);
S.push(arr[i]);
break;
}
else
{
S.pop();
}
}
}
stack<int> S2;
for(int i=n-1;i>=0;i--)
{
while(true)
{
if(S.empty())
{
S.push(arr[i]);
break;
}
else if(S.top() < arr[i] )
{
m = max(m, S.top()^arr[i]);
S.push(arr[i]);
break;
}
else
{
S.pop();
}
}
}
cout<<m<<endl;
return 0;
}
In Java :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] arr = new int[n];
for(int i = 0; i < n; i++){
arr[i] = in.nextInt();
}
Stack<Integer> stack = new Stack<Integer>();
int result = 0;
for(int i = 0; i < n; i++){
while(true){
if(stack.isEmpty()){
stack.add(arr[i]);
break;
} else if(stack.peek() < arr[i]){
result = Math.max(result, stack.peek() ^ arr[i]);
stack.add(arr[i]);
break;
} else{
stack.pop();
}
}
}
stack = new Stack<Integer>();
for(int i = n - 1; i >= 0; i--){
while(true){
if(stack.isEmpty()){
stack.add(arr[i]);
break;
} else if(stack.peek() < arr[i]){
result = Math.max(result, stack.peek() ^ arr[i]);
stack.add(arr[i]);
break;
} else{
stack.pop();
}
}
}
System.out.println(result);
}
}
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
long long int sol(int A, int B)
{
return (((A & B) ^ (A | B)) & (A ^ B));
}
long long int inter(long long int arr[], int n)
{
int i,j;
long long int min1 = 9999999999, min2 = 9999999999, max = -1;
for(i=0;i<n-1;i++)
{
if(sol(arr[i], arr[i+1]) > max)
max = sol(arr[i], arr[i+1]);
if(i+2 <= n-1)
if(arr[i+1] > arr[i] && arr[i+1] > arr[i+2] && sol(arr[i], arr[i+2]) > max)
max = sol(arr[i], arr[i+2]);
}
return max;
}
int main()
{
int n,i;
scanf("%d", &n);
long long int arr[n];
for(i=0;i<n;i++)
{
scanf("%lli", &arr[i]);
}
printf("%lli", inter(arr, n));
return 0;
}
In Python3 :
n_elements = int(input())
data = list(map(int, input().split()))
assert len(data) == n_elements
res = 0
minima = [data[0]]
for i in range(1, n_elements):
d = data[i]
while len(minima):
x = minima.pop()
res = max(d ^ x, res)
if x < d:
minima.append(x)
break
minima.append(d)
print(res)
View More Similar Problems
No Prefix Set
There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio
View Solution →Cube Summation
You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor
View Solution →Direct Connections
Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do
View Solution →Subsequence Weighting
A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =
View Solution →Kindergarten Adventures
Meera teaches a class of n students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from 1 to n in the clockwise direction. This means that the students are numbered 1, 2, 3, . . . , n-1, n, and students 1 and n are sitting next to each other. After letting the students draw for a certain period of ti
View Solution →Mr. X and His Shots
A cricket match is going to be held. The field is represented by a 1D plane. A cricketer, Mr. X has N favorite shots. Each shot has a particular range. The range of the ith shot is from Ai to Bi. That means his favorite shot can be anywhere in this range. Each player on the opposite team can field only in a particular range. Player i can field from Ci to Di. You are given the N favorite shots of M
View Solution →