ST表

#include <bits/stdc++.h>
using namespace std;

int st[100000][17];
int meow[100000];
int n;

void st_init(){
    int jmax = floor(log(n)/log(2));
    for (int i = 0; i < n; i++)
        st[i][0] = meow[i];
    for (int j = 1; j <= jmax; j++)
        for (int i = 0; i < n; i++)
            if (i + (1 << j) - 1 <= n)
                st[i][j] = min(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
}

int st_query(int n, int m){
    int k = floor(log(m - n + 1) / log(2));
    return min(st[n][k], st[m - (1 << k) + 1][k]);
}

int main(){
    n = 5;
    for (int i = 0; i < n; i++)
        cin >> meow[i];
    st_init();
    cout << st_query(0, n - 1);
    return 0;
}