RMQ 算法

跳跳跳

#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<cstdio>
using namespace std;
int n,m;
int f[250005][22]={0};

int read()
{
    int x=0,w=1;
    char c=getchar();
    while(c<'0' || c>'9'){if(c=='-') w=-1;c=getchar();};
    while(c>='0' && c<='9') x=x*10+c-'0',c=getchar();
    return x*w;
}

int main()
{
	n=read();

	for(int i=1;i<=n;i++)   f[i][0]=read();  
	for(int j=1;j<=20;j++)
	for(int i=1;i<=n;i++)
	if(i+(1<<(j-1))<=n)  f[i][j]=min(f[i][j-1],f[i+(1<<(j-1))][j-1]);
    //预处理 F[][]
    
	m=read();
    int x,y;
    while(m--)
    {
    	x=read();y=read();
    	if(x>y)  swap(x,y);

    	int k=log2(y-x+1);
    	printf("%d\n",min( f[x][k],f[y-(1<<k)+1][k] ) );
        //求值
    }
	return 0;
}

 

    for(int i=1;i<=n;i++)  scanf("%d",&a[i][0]);
    for(int j=1;j<=20;j++)
    for(int i=1;i<=n;i++)
    if(i+1<<(j-1)<=n)   f[i][j]=min(f[i][j-1],f[i+1<<(j-1)][j-1]);
    
    int k=log2(len);
    int ans=min(f[l][k],f[y-(1<<k)+1][k]);