Pagini recente » Cod sursa (job #1502942) | Cod sursa (job #1748896) | Cod sursa (job #1044824) | Cod sursa (job #1028853) | Cod sursa (job #3180897)
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,q,rmq[18][100010];
int main()
{
f>>n>>q;
for(int i=1;i<=n;i++)
f>>rmq[0][i];
for(int i=1,pas=1;i<=18;i++,pas*=2)
for(int j=1;j<=n-pas;j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+pas]);
while(q--)
{
int x,y,pow,exp;
f>>x>>y;
exp=31-__builtin_clz(y-x+1);
pow=1<<exp;
g<<min(rmq[exp][x],rmq[exp][y-pow+1])<<'\n';
}
return 0;
}