Pagini recente » Cod sursa (job #1346884) | Cod sursa (job #49733) | Cod sursa (job #2061428) | Cod sursa (job #19280) | Cod sursa (job #2790998)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int a[20][100001];
int log[100001];
int n, m, len, x, y, putere;
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
fin>>a[0][i];
for(int i=2;i<=n;i++)
log[i]=log[i/2]+1;
for(int i=1;i<=log[n];i++)
{
for(int j=1;j+(1<<i)-1<=n;j++)
a[i][j]=min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
}
for(int i=1;i<=m;i++){
fin>>x>>y;
len=y-x+1;
putere=log[len];
fout<<min(a[putere][x],a[putere][y-(1<<putere)+1])<<"\n";
}
return 0;
}