Pagini recente » Cod sursa (job #2984205) | Cod sursa (job #1101180) | Cod sursa (job #1158333) | Cod sursa (job #1939754) | Cod sursa (job #1584801)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int dp[18][100001];
int mini(int a,int b)
{
if(a<=b) return a;
return b;
}
int putere(int x)
{
int i;
for(i=0;(1<<i)<=x;i++);
return i-1;
}
int main()
{
int n,m,i,a,b,k,j;
fin>>n>>m;
for(i=1;i<=n;i++)
{
fin>>dp[0][i];
}
for(i=1;(1<<i)<=n;i++)
{
for(j=1;j<=n-(1<<i)+1;j++)
{
dp[i][j]=mini(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
}
}
for(i=1;i<=m;i++)
{
fin>>a>>b;
k=putere(b-a);
fout<<mini(dp[k][a],dp[k][b-(1<<k)+1])<<"\n";
}
}