Pagini recente » Cod sursa (job #1584874) | Cod sursa (job #3241364) | Cod sursa (job #2110582) | Cod sursa (job #1595488) | Cod sursa (job #696068)
Cod sursa(job #696068)
#include <fstream>
int n,m,i,j,lg[100005],a[100005][20],x,y,l;
using namespace std;
int main ()
{ifstream f("rmq.in");
ofstream g("rmq.out");
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i][0];
for(j=1;(1<<j)<n;j++)
for(i=1;i+(1<<j)<=n+1;i++)
{a[i][j]=min(a[i][j-1],a[i+(1<<(j-1))][j-1]);
}
lg[1]=0;
for(i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
while(m)
{f>>x>>y;
l=y-x;
l=lg[l];
g<<min(a[x][l],a[y-(1<<l)+1][l])<<'\n';
m--;}
f.close(); g.close();
return 0;
}