Pagini recente » Cod sursa (job #1532160) | Cod sursa (job #1398805) | Cod sursa (job #714590) | Cod sursa (job #2530776) | Cod sursa (job #2664267)
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int lookup[100001][22],v[100001],len,n,m;
void BuildSparseTable ()
{
int i,j;
for(j=1;j<=n;j++)
lookup[0][j]=v[j];
for(i=1;1<<i<=n;i++)
for(j=1;(j+(1<<i)-1)<=n;j++)
lookup[i][j]=min(lookup[i-1][j],lookup[i-1][j+1<<(i-1)]);
}
void afisare()
{
int i,j;
for(i=0;1<<i<=n;i++)
{for(j=1;j<=n;j++)
cout<<lookup[i][j]<<" ";
cout<<endl;}
}
int main()
{
int i,a,b,j,scad;
f>>n>>m;
for(i=1;i<=n;i++)
f>>v[i];
len=ceil(log2(n));
BuildSparseTable();
for(i=1;i<=m;i++)
{
f>>a>>b;
if(a==b) g<<v[a];
else{
j=floor(log2(b-a+1));
g<<min(lookup[j][a],lookup[j][b - (1<<j)+1])<<"\n";
}}
}