Pagini recente » Cod sursa (job #2147390) | Cod sursa (job #1830140) | Cod sursa (job #1486487) | Cod sursa (job #1523577) | Cod sursa (job #2480970)
#include <iostream>
#include <fstream>
using namespace std;
int r[17][100005];
int log[100005];
int main()
{
ifstream in("rmq.in");
ofstream out("rmq.out");
int n,m;
in>>n>>m;
for (int j=0;j<n;j++)
{
in>>r[0][j];
}
log[1]=0;
for (int i=2;i<=n;i++)
{
log[i]=1+log[i/2];
}
for (int i=1;i<=log[n];i++)
{
for (int j=0;j<n;j++)
{
r[i][j]=min(r[i-1][j],r[i-1][j+(1<<(i-1))]);
}
}
int q,p;
for (int i=1;i<=m;i++)
{
in>>p>>q;
p--;
q--;
int l=log[q-p+1];
out<<min(r[l][p],r[l][q-(1<<l)+1])<<"\n";
}
in.close();
out.close();
return 0;
}