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