Pagini recente » Cod sursa (job #2936455) | Cod sursa (job #33463) | Cod sursa (job #1355522) | Cod sursa (job #2866020) | Cod sursa (job #1806896)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,q,i,j,k,val,x,y;
int d[25][100005],p[100005],l[100005];
int main ()
{
fin>>n>>q;
for(i=1;i<=n;i++)
fin>>d[0][i];
p[1]=0;
for(i=2;i<=n;i++)
p[i]=1+p[i/2];
for(i=1;(1<<i)<=n;i++)
for(j=1;j<=n;j++)
d[i][j]=min(d[i-1][j],d[i-1][j+(1<<(i-1))]);
for (i=1;i<=q;i++)
{
fin>>x>>y;
val=p[y-x+1];
fout<<min(d[val][x],d[val][y-(1<<val)+1])<<"\n";
}
return 0;
}