Pagini recente » Cod sursa (job #727636) | Cod sursa (job #2162496) | Cod sursa (job #1731820) | Cod sursa (job #2256105) | Cod sursa (job #3129759)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int q,r[100001][100001],n,log2[100001];
int main()
{ fin>>n>>q;
for(int i=1;i<=n;++i)
fin>>r[0][i];
for(int i=1;(1<<i)<=n;i++)
for(int j=(1<<i);j<=n;j++)
{int p=1<<(i-1);
r[i][j]=min(r[i-1][j-p],r[i-1][j]);}
log2[1]=0;
for(int i=2;i<=n;i++)
log2[i]=log2[i/2]+1;
for (int i = 0 ;i < q; i++)
{
int st, dr;
fin >> st >> dr;
int e = log2[dr-st+1];
int p = 1 << e;
fout << min(r[e][st+p-1], r[e][dr]) << "\n";
}
return 0;
}