Pagini recente » Cod sursa (job #2106434) | Cod sursa (job #527673) | Cod sursa (job #1845236) | Cod sursa (job #1113307) | Cod sursa (job #2089465)
#include<fstream>
#include<iostream>
using namespace std;
ifstream fi("rmq.in");
ofstream fo("rmq.out");
int n,m,i,j,p,A[100001],T[100001][21],st,x,y,rez;
int main()
{
fi>>n>>m;
for(i=1; i<=n; i++)
fi>>A[i];
//precalculare
for(i=1; i<=n; i++)
T[i][0]=A[i];
for(j=1; j<=19; j++)
{
p=1<<j;
for(i=1; i<=n-p+1; i++)
{
T[i][j]=min(T[i][j-1],T[i+(1<<(j-1))-1][j-1]);
}
}
/*for(i=1; i<=n; i++)
{
for(j=0; j<=19; j++)
cout<<T[i][j]<<" ";
cout<<"\n";
}*/
for(i=1; i<=m; i++)
{
fi>>x>>y;
st=x;
rez=1000000000;
for(j=19; j>=0; j--)
{
if(st+(1<<j)-1<=y)
{
rez=min(rez,T[st][j]);
st+=(1<<j);
}
}
fo<<rez<<"\n";
}
fi.close();
fo.close();
return 0;
}