Pagini recente » Cod sursa (job #2051427) | Cod sursa (job #203854) | Cod sursa (job #2284209) | Cod sursa (job #758400) | Cod sursa (job #831854)
Cod sursa(job #831854)
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int v[100001],m[100001][17];
int main()
{
int n,i,j,x,a,b,k;
f>>n>>x;
for(i=1;i<=n;i++)
{
f>>v[i];
m[i][0]=i;
}
for(j=1;(1<<j)<n;j++)
{
for(i=1;i+1<<(j-1)<=n;i++)
{
if(v[m[i][j-1]]<v[m[i+1<<(j-1)][j-1]])
m[i][j]=m[i][j-1];
else m[i][j]=m[i+1<<(j-1)][j-1];
}
}
for(i=0;i<x;i++)
{
f>>a>>b;
k=(b-a)+1;
for(j=17;j>=0;j--)
if(1<<j <= k && k < 1<<(j+1) ) { k=j; break;}
if(v[m[a][k]]<v[m[b-(1<<k)+1][k]]) g<<v[m[a][k]]<<'\n';
else g<<v[m[b-(1<<k)+1][k]]<<'\n';
}
}