C#: Implement interval minimum value query (RMQ) algorithm

Range Minimum Query (RMQ) is a common algorithm problem used to query the minimum value within a specified interval in a given array. In this article, we will introduce how to implement the RMQ algorithm using the C# programming language and provide corresponding source code examples.

There are many implementation methods of the RMQ algorithm, one of the more efficient methods is to use the segment tree (Segment Tree) data structure. Segment tree is a binary tree used to handle interval query problems. Each node represents an interval, the left child node of the node represents the left half of the interval, and the right child node represents the right half of the interval. The root node represents the range of the entire array. Each node also saves the minimum value within the interval.

The following is a sample code for implementing the RMQ algorithm using C#:

using System;

class SegmentTree
{
   
    
    
    private int[] tree;
    private