Pagini recente » Cod sursa (job #839287) | Cod sursa (job #82402) | Cod sursa (job #540615) | Cod sursa (job #2499941) | Cod sursa (job #1529762)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int a[100001],rmq[100][100001];
int log[100001];
int main()
{
int i,n,j,m,x,y;
fin>>n>>m;
for(i=1; i<=n; i++)
{
fin>>a[i];
rmq[0][i]=a[i];
}
for(i=1; (1<<i)<=n; i++)
for(j=1; j+(1<<i)-1<=n; j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
log[1]=0;
for(i=2; i<=n; i++)
log[i]=log[i/2]+1;
for(i=1; i<=m; i++)
{
fin>>x>>y;
fin>>x>>y;
j=log[y-x+1];
fout<<min(rmq[j][x],rmq[j][y-(1<<j)+1])<<'\n';
}
return 0;}