Pagini recente » Cod sursa (job #2367011) | Cod sursa (job #2942522) | Cod sursa (job #588662) | Cod sursa (job #57194) | Cod sursa (job #2734488)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int main()
{
int n,m,j,rmq[20][100002],lg,x,y,z,i,k,rez;
fin>>n>>m;
for(j=1;j<=n;j++)
fin>>rmq[0][j];
for( i=1,lg=2; lg<=n ; i++,lg=2*lg )
for( j=1 ; j+lg-1<=n ; j++ )
rmq[i][j] = min( rmq[i-1][j] , rmq[i-1][j+lg/2] );
for(k=1;k<=m;k++)
{
fin>>x>>y;
z=y-x+1;
i=0;
lg=1;
while(lg*2<=z)
{
i++;
lg=lg*2;
}
cout<<x<<' '<<y<<' '<<i<<' '<<lg<<endl;
rez=min(rmq[i][x],rmq[i][y-lg+1]);
fout<<rez<<'\n';
}
return 0;
}