在[L，R]范围内评估给定方程的查询

给定一个由N个整数组成的数组arr []并使用{L，R}形式的查询Q [] [] ，其中0≤L ，每个查询的任务是计算以下方程式：

K_L | K_{L + 1} |…| K_{R – 1} 
where K_i = (arr[i] ^ arr[i+1]) | (arr[i] ~ arr[i+1]), 
“~” represents binary XNOR, 
“^” represents binary XOR , 
“|” represents binary OR 
 

例子：

Input: arr[] = {5, 2, 3, 0}, Q[][] = {{1, 3}, {0, 2}} 
Output: 3 7 
Explanation: 
Query 1: L = 1, R = 3 : K₁ = (2 ^ 3) | (2 ~ 3) = (3 | 2) = 3, K₂ = (3 ^ 0) | (3 ~ 0) = (3 | 0) = 3. 
Therefore, K₁ | K₂ = (3 | 3) = 3 
Query 2: L = 0, R = 2 : K₀ = 7, K₁ = 3. 
Therefore, K₀ | K₁ = (7 | 3) = 7

Input: arr[] = {4, 0, 1, 2}, Q[][] = {{1, 3}} 
Output: 3 
 

天真的方法：解决此问题的最简单方法是遍历索引[L，R – 1] ，并为每个元素计算K _i ，其中L≤i 。

时间复杂度： O(N * sizeof(Q))

高效方法：为了优化上述方法，其思想是使用段树或稀疏表。请按照以下步骤解决问题：

• 需要进行以下观察：

XOR operation sets only those bits which are either set in arr_i or in arr_i+1 
XNOR sets those bits which are either set in both a_i and a_i+1 or not set in both.

• 对这两个操作进行“或”运算，将设置最大到max(MSB(arr _i )，MSB(arr _{i + 1} ))中最大值的所有位。
• 因此，使用段树在给定索引之间找到最大的数字，并将其所有位设置为1，以获得所需的答案。
• 打印答案。

下面是上述方法的实现：

C++

// C++ Program to implement
// the above approach
#include 
using namespace std;
 
// Function to obtain the
// middle index of the range
int getMid(int s, int e)
{
    return s + (e - s) / 2;
}
 
/* Recursive function to get the sum of
   values in the given range from the array.
   The following are parameters for this
   function.
 
    st     -> Pointer to segment tree
 
    node     -> Index of current node in
                the segment tree
 
    ss & se -> Starting and ending indexes
               of the segment represented
               by current node, i.e., st[node]
 
    l & r -> Starting and ending indexes
             of range query */
int MaxUtil(int* st, int ss, int se, int l,
            int r, int node)
{
    // If the segment of this node lies
    // completely within the given range
    if (l <= ss && r >= se)
 
        // Return maximum in the segment
        return st[node];
 
    // If the segment of this node lies
    // outside the given range
    if (se < l || ss > r)
        return -1;
 
    // If segment of this node lies
    // partially in the given range
    int mid = getMid(ss, se);
 
    return max(MaxUtil(st, ss, mid, l, r,
                       2 * node + 1),
               MaxUtil(st, mid + 1, se, l,
                       r, 2 * node + 2));
}
 
// Function to return the maximum in the
// range from [l, r]
int getMax(int* st, int n, int l, int r)
{
    // Check for erroneous input values
    if (l < 0 || r > n - 1 || l > r) {
        printf("Invalid Input");
        return -1;
    }
 
    return MaxUtil(st, 0, n - 1, l, r, 0);
}
 
// Function to construct Segment Tree
// for the subarray [ss..se]
int constructSTUtil(int arr[], int ss, int se,
                    int* st, int si)
{
    // For a single element
    if (ss == se) {
        st[si] = arr[ss];
        return arr[ss];
    }
 
    // Otherwise
    int mid = getMid(ss, se);
 
    // Recur for left subtree
    st[si] = max(constructSTUtil(arr, ss, mid, st,
                                 si * 2 + 1),
 
                 // Recur for right subtree
                 constructSTUtil(arr, mid + 1, se,
                                 st, si * 2 + 2));
 
    return st[si];
}
 
// Function to construct Segment Tree from
// the given array
int* constructST(int arr[], int n)
{
    // Height of Segment Tree
    int x = (int)(ceil(log2(n)));
 
    // Maximum size of Segment Tree
    int max_size = 2 * (int)pow(2, x) - 1;
 
    // Allocate memory
    int* st = new int[max_size];
 
    // Fill the allocated memory
    constructSTUtil(arr, 0, n - 1, st, 0);
 
    // Return the constructed Segment Tree
    return st;
}
 
// Driver Code
int main()
{
    int arr[] = { 5, 2, 3, 0 };
    int n = sizeof(arr) / sizeof(arr[0]);
 
    // Build the Segment Tree
    // from the given array
    int* st = constructST(arr, n);
 
    vector > Q = { { 1, 3 }, { 0, 2 } };
    for (int i = 0; i < Q.size(); i++) {
 
        int max = getMax(st, n, Q[i][0], Q[i][1]);
        int ok = 0;
        for (int i = 30; i >= 0; i--) {
            if ((max & (1 << i)) != 0)
                ok = 1;
 
            if (!ok)
                continue;
 
            max |= (1 << i);
        }
 
        cout << max << " ";
    }
 
    return 0;
}

Java

// Java Program to implement
// the above approach
import java.util.*;
class GFG{
 
// Function to obtain the
// middle index of the range
static int getMid(int s, int e)
{
    return s + (e - s) / 2;
}
 
/* Recursive function to get the sum of
   values in the given range from the array.
   The following are parameters for this
   function.
 
    st    .Pointer to segment tree
 
    node    .Index of current node in
                the segment tree
 
    ss & se.Starting and ending indexes
               of the segment represented
               by current node, i.e., st[node]
 
    l & r.Starting and ending indexes
             of range query */
static int MaxUtil(int[] st, int ss,
                   int se, int l,
                   int r, int node)
{
    // If the segment of this node lies
    // completely within the given range
    if (l <= ss && r >= se)
 
        // Return maximum in the segment
        return st[node];
 
    // If the segment of this node lies
    // outside the given range
    if (se < l || ss > r)
        return -1;
 
    // If segment of this node lies
    // partially in the given range
    int mid = getMid(ss, se);
 
    return Math.max(MaxUtil(st, ss, mid, l, r,
                                2 * node + 1),
                       MaxUtil(st, mid + 1, se, l,
                             r, 2 * node + 2));
}
 
// Function to return the maximum in the
// range from [l, r]
static int getMax(int []st, int n,
                  int l, int r)
{
    // Check for erroneous input values
    if (l < 0 || r > n - 1 || l > r)
    {
        System.out.printf("Invalid Input");
        return -1;
    }
 
    return MaxUtil(st, 0, n - 1, l, r, 0);
}
 
// Function to conSegment Tree
// for the subarray [ss..se]
static int constructSTUtil(int arr[], int ss,
                           int se, int[] st,
                           int si)
{
    // For a single element
    if (ss == se)
    {
        st[si] = arr[ss];
        return arr[ss];
    }
 
    // Otherwise
    int mid = getMid(ss, se);
 
    // Recur for left subtree
    st[si] = Math.max(constructSTUtil(arr, ss, mid, st,
                                            si * 2 + 1),
 
                      // Recur for right subtree
                      constructSTUtil(arr, mid + 1, se,
                                       st, si * 2 + 2));
 
    return st[si];
}
 
// Function to conSegment Tree from
// the given array
static int[] constructST(int arr[], int n)
{
    // Height of Segment Tree
    int x = (int)(Math.ceil(Math.log(n)));
 
    // Maximum size of Segment Tree
    int max_size = 2 * (int)Math.pow(2, x) - 1;
 
    // Allocate memory
    int []st = new int[max_size];
 
    // Fill the allocated memory
    constructSTUtil(arr, 0, n - 1, st, 0);
 
    // Return the constructed Segment Tree
    return st;
}
 
// Driver Code
public static void main(String[] args)
{
    int arr[] = { 5, 2, 3, 0 };
    int n = arr.length;
 
    // Build the Segment Tree
    // from the given array
    int []st = constructST(arr, n);
 
    int[][] Q = { { 1, 3 }, { 0, 2 } };
    for (int i = 0; i < Q.length; i++)
    {
        int max = getMax(st, n, Q[i][0], Q[i][1]);
        int ok = 0;
        for (int j = 30; j >= 0; j--)
        {
            if ((max & (1 << j)) != 0)
                ok = 1;
 
            if (ok<=0)
                continue;
 
            max |= (1 << j);
        }
        System.out.print(max+ " ");
    }
}
}
 
// This code is contributed by gauravrajput1

Python3

# Python3 program to implement
# the above approach
import math
 
# Function to obtain the
# middle index of the range
def getMid(s, e):
     
    return (s + (e - s) // 2)
 
def MaxUtil(st, ss, se, l, r, node):
     
    # If the segment of this node lies
    # completely within the given range
    if (l <= ss and r >= se):
         
        # Return maximum in the segment
        return st[node]
 
    # If the segment of this node lies
    # outside the given range
    if (se < l or ss > r):
        return -1
 
    # If segment of this node lies
    # partially in the given range
    mid = getMid(ss, se)
 
    return max(MaxUtil(st, ss, mid, l,
                       r, 2 * node + 1),
               MaxUtil(st, mid + 1, se,
                       l, r, 2 * node + 2))
 
# Function to return the maximum
# in the range from [l, r]
def getMax(st, n, l, r):
     
    # Check for erroneous input values
    if (l < 0 or r > n - 1 or l > r):
        print("Invalid Input")
        return -1
     
    return MaxUtil(st, 0, n - 1, l, r, 0)
 
# Function to conSegment Tree
# for the subarray [ss..se]
def constructSTUtil(arr, ss, se, st, si):
 
    # For a single element
    if (ss == se):
        st[si] = arr[ss]
        return arr[ss]
 
    # Otherwise
    mid = getMid(ss, se)
 
    # Recur for left subtree
    st[si] = max(constructSTUtil(arr, ss, mid, st,
                                 si * 2 + 1),
                 constructSTUtil(arr, mid + 1, se,
                                 st, si * 2 + 2))
    return st[si]
 
# Function to conSegment Tree
# from the given array
def constructST(arr, n):
 
    # Height of Segment Tree
    x = (int)(math.ceil(math.log(n)))
 
    # Maximum size of Segment Tree
    max_size = 2 * (int)(pow(2, x)) - 1
 
    # Allocate memory
    st = [0] * max_size
 
    # Fill the allocated memory
    constructSTUtil(arr, 0, n - 1, st, 0)
 
    # Return the constructed Segment Tree
    return st
 
# Driver Code
arr = [ 5, 2, 3, 0 ]
n = len(arr)
 
# Build the Segment Tree
# from the given array
st = constructST(arr, n)
 
Q = [ [ 1, 3 ], [ 0, 2 ] ]
for i in range(len(Q)):
    Max = getMax(st, n, Q[i][0], Q[i][1])
    ok = 0
     
    for j in range(30, -1, -1):
        if ((Max & (1 << j)) != 0):
            ok = 1
 
        if (ok <= 0):
            continue
 
        Max |= (1 << j)
     
    print(Max, end = " ")
 
# This code is contributed by divyesh072019

C#

// C# Program to implement
// the above approach
using System;
class GFG {
 
    // Function to obtain the
    // middle index of the range
    static int getMid(int s, int e)
    {
        return s + (e - s) / 2;
    }
 
    /* Recursive function to get the sum of
    values in the given range from the array.
    The following are parameters for this
    function:
    st--> Pointer to segment tree
    node--> Index of current node
    in segment tree
    ss & se--> Starting and ending indexes
    of the segment represented
    by current node, i.e., st[node]
    l & r--> Starting and ending indexes
    of range query */
    static int MaxUtil(int[] st, int ss, int se,
                       int l, int r, int node)
    {
 
        // If the segment of this node lies
        // completely within the given range
        if (l <= ss && r >= se)
 
            // Return maximum in the segment
            return st[node];
 
        // If the segment of this node lies
        // outside the given range
        if (se < l || ss > r)
            return -1;
 
        // If segment of this node lies
        // partially in the given range
        int mid = getMid(ss, se);
 
        return Math.Max(
            MaxUtil(st, ss, mid, l, r, 2 * node + 1),
            MaxUtil(st, mid + 1, se, l, r, 2 * node + 2));
    }
 
    // Function to return the maximum
    // in the range from [l, r]
    static int getMax(int[] st, int n, int l, int r)
    {
        // Check for erroneous input values
        if (l < 0 || r > n - 1 || l > r)
        {
            Console.Write("Invalid Input");
            return -1;
        }
        return MaxUtil(st, 0, n - 1, l, r, 0);
    }
 
    // Function to conSegment Tree
    // for the subarray [ss..se]
    static int constructSTUtil(int[] arr, int ss, int se,
                               int[] st, int si)
    {
        // For a single element
        if (ss == se)
        {
            st[si] = arr[ss];
            return arr[ss];
        }
 
        // Otherwise
        int mid = getMid(ss, se);
 
        // Recur for left subtree
        st[si] = Math.Max(
            constructSTUtil(arr, ss, mid, st,
                            si * 2 + 1),
 
            // Recur for right subtree
            constructSTUtil(arr, mid + 1, se, st,
                            si * 2 + 2));
        return st[si];
    }
 
    // Function to conSegment Tree
    // from the given array
    static int[] constructST(int[] arr, int n)
    {
        // Height of Segment Tree
        int x = (int)(Math.Ceiling(Math.Log(n)));
 
        // Maximum size of Segment Tree
        int max_size = 2 * (int)Math.Pow(2, x) - 1;
 
        // Allocate memory
        int[] st = new int[max_size];
 
        // Fill the allocated memory
        constructSTUtil(arr, 0, n - 1, st, 0);
 
        // Return the constructed Segment Tree
        return st;
    }
 
    // Driver Code
    public static void Main(String[] args)
    {
        int[] arr = {5, 2, 3, 0};
        int n = arr.Length;
 
        // Build the Segment Tree
        // from the given array
        int[] st = constructST(arr, n);
 
        int[, ] Q = {{1, 3}, {0, 2}};
        for (int i = 0; i < Q.GetLength(0); i++) {
            int max = getMax(st, n, Q[i, 0], Q[i, 1]);
            int ok = 0;
            for (int j = 30; j >= 0; j--) {
                if ((max & (1 << j)) != 0)
                    ok = 1;
 
                if (ok <= 0)
                    continue;
 
                max |= (1 << j);
            }
            Console.Write(max + " ");
        }
    }
}
 
// This code is contributed by Amit Katiyar

输出：

3 7

时间复杂度： O(N * log(sizeof(Q))
辅助空间： O(N)