Pagini recente » Cod sursa (job #3212114) | Cod sursa (job #472998) | Cod sursa (job #1675865) | Cod sursa (job #885600) | Cod sursa (job #1543826)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,p,lung,a[20][100005],i,x,y,j,sol,log[100000];
int main()
{
fin>>n>>m;
log[1]=0;
for(i=2;i<=n;i++)
log[i]=log[i/2]+1;
for(i=1;i<=n;i++)
fin>>a[0][i];
p=log[n];
for(i=1;i<=p;i++)
for(j=1;j+(1<<i)-1<=n;j++)
a[i][j]=min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
while(m)
{
m--;
fin>>x>>y;
int dif=y-x+1;
p=log[dif];
sol=min(a[p][x],a[p][y-(1<<p)+1]);
fout<<sol<<"\n";
}
return 0;
}