Pagini recente » Cod sursa (job #217554) | Cod sursa (job #2308195) | Cod sursa (job #1750528) | Cod sursa (job #2159920) | Cod sursa (job #1714928)
#include <bits\stdc++.h>
using namespace std;
int a[100005][25],t[100005],n,m;
int main()
{
int x,y,k,s,i;
ifstream fin("rmq.in");
fin>>n>>m;
for(i=1;i<=n;i++)
{
fin>>t[i];
a[i][0]=t[i];
}
for(k=1,s=2;s<=n;s*=2,k++)
{
for(i=1;i+s-1<=n;i++)
{
a[i][k]=min(a[i][k-1],a[i+s/2][k-1]);
}
}
ofstream fout("rmq.out");
for(i=1;i<=m;i++)
{
fin>>x>>y;
s=1;
k=0;
while(s*2+x-1<=y)
{
k++;
s*=2;
}
fout<<min(a[x][k],a[y-s+1][k])<<"\n";
}
fout.close();
fin.close();
return 0;
}