{"id":2290,"date":"2020-06-15T03:52:23","date_gmt":"2020-06-15T03:52:23","guid":{"rendered":"https:\/\/blog.prepbytes.com\/?p=2290"},"modified":"2022-03-11T06:27:55","modified_gmt":"2022-03-11T06:27:55","slug":"maximum-divisor","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/maximum-divisor\/","title":{"rendered":"Maximum Divisor"},"content":{"rendered":"

\"\"<\/p>\n

Concepts Used<\/h4>\n
\n

Segment Trees, GCD<\/p>\n<\/blockquote>\n

Difficulty Level<\/h4>\n
\n

Medium<\/p>\n<\/blockquote>\n

Problem Statement :<\/h4>\n
\n

Given an array of N<\/code> elements and Q<\/code> queries. In each query, two values is given l<\/code> and r<\/code>. We have to find a maximum positive integer x<\/code> where arr[l]%x = arr[l+1]%x =...=arr[r]%x = 0<\/code>.<\/p>\n<\/blockquote>\n

<\/strong><\/u><\/a><\/p>\n

Solution Approach :<\/h4>\n
\n

Introduction :<\/h4>\n

We have to find a number x<\/code> which completely divides all the elements within a given range. There is a term in mathematics for x<\/code>, can you guess what is it? For those who has answer GCD<\/code> they are right. Now our problem breaks down to finding the GCD<\/strong> within a given range.<\/p>\n

Idea is to construct a segment tree<\/strong> with the leaf nodes having the array values and intermediate nodes stores the GCD of the current subarray range.<\/p>\n<\/blockquote>\n

\"\"<\/p>\n

\n

Method 1 (Brute force):<\/h4>\n

We can calculate the GCD in the given range l<\/code> to r<\/code> for every query. This approach will work fine for smaller array sizes and queries, as it takes linear time for finding the gcd of the values for single query. As the size of the input increases this apprach will be huge drawback.<\/p>\n

Method 2 (Segment Tree):<\/h4>\n

As the number of queries and array size is too large for linear search in every query, we will use segment tree<\/strong> to solve this problem.
\nA Segment Tree<\/strong> is a data structure which allows answering range queries very effectively over a large input. Each query takes logarithmic time. Range queries includes sum over a range, or finding a minimum value over a given range etc. Query be of any type we can use segment trees and modify it accordingly.
\nLeaf nodes of the tree stores the actual array values and intermediate nodes stores the information of subarrays with is require to solve the problem. Lets say if we have to find a sum between different ranges, so now the intermediate nodes will store the sum of the current subarray. We fill the nodes by recursively calling left and right subtree (dividing into segements), untill there is a single element left, which can be directly assigned the value of the array. Array representation of the tree is used to represent segment tree, where (i*2)+1<\/code> represents the left node and (i*2)+2<\/code> represents right node, parent will be represented by (i-1)\/2<\/code> for every index i<\/code>.
\nWe will construct<\/strong> our tree by starting at the original array and dividing it into two halves (left and right), untill there is a single element left (leaf) which can directly be filled with a[i]<\/code> for any index i<\/code>. Now for every range say l<\/code> to r<\/code>, we will store the gcd of the current range in the node.
\nNow that our tree is constructed, we will answer queries<\/strong> (gcd of the given range). The queries can be of 3<\/code> types: <\/p>\n

    \n
  1. The range of the tree exactly matches with the query, in this case we will return the value stored in this node.<\/li>\n
  2. The range either belongs to the left<\/code> or right<\/code> node, in this case we will make two recursive calls for left<\/code> and right<\/code> subtrees respectively.<\/li>\n
  3. The range overlaps with two of more ranges, in this case we are forced to go to the lower levels of both the subtrees and find the gcd of the range which fits the current range and finally return the gcd of the values returned by both subtrees.<\/li>\n<\/ol>\n<\/blockquote>\n

    Algorithm :<\/h4>\n
    \n

    construct():<\/h4>\n
      \n
    • if the current node is a leaf (subarray contains single element), assign the value directly, (tree[curr]= arr[l])<\/code>.<\/li>\n
    • break the tree into two halves by recursively calling for left and right subtree, construct(l,mid)<\/code> and construct(mid+1,r)<\/code><\/li>\n
    • fill the current node with the gcd of left & right node. (tree[curr] = GCD(LeftSubtree , RightSubtree)<\/code>.<\/li>\n<\/ul>\n

      RMQ():<\/h4>\n
        \n
      • if range is within the current range, return the value stored in node.<\/li>\n
      • if current range is outside the boundaries, return -1<\/code>.<\/li>\n
      • else return the gcd of left & right subtrees.<\/li>\n<\/ul>\n

        Complexity Analysis :<\/h4>\n

        In segment tree, preprocessing time is O(n)<\/code> and worst time to for range minimum query is equivalent to the height of the tree.
        \nThe space complexity<\/strong> is O(n)<\/code> to store the segment tree.<\/p>\n<\/blockquote>\n

        Solutions:<\/h2>\n\t\t\t\t\t\t