Pagini recente » Cod sursa (job #2583012) | Cod sursa (job #1665810) | Cod sursa (job #256180) | Cod sursa (job #1499788) | Cod sursa (job #2121171)
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int rmq[100005][20],log2[100005];
int main()
{
int n,m,x,y;
in>>n>>m;
for (int i=1; i<=n; i++)
in>>rmq[i][0];
for (int i=2; i<=n; i++)
log2[i]=1+log2[i/2];
for (int j=1; (1<<j)<=n; j++)
for (int i=1; i+(1<<j)-1<=n; i++)
rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
for (int i=1;i<=m;i++)
{
in>>x>>y;
if (x>y) swap(x,y);
int k=log2[y-x+1];
int sol=rmq[x][k];
if (rmq[y-(1<<k)+1][k]<sol)
sol=rmq[y-(1<<k)+1][k];
out<<sol<<'\n';
}
return 0;
}