Pagini recente » Cod sursa (job #3234675) | Cod sursa (job #2781559) | Cod sursa (job #1810270) | Cod sursa (job #1481534) | Cod sursa (job #2581596)
#include <fstream>
#define Nmax 100001
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,dp[21][Nmax],x;
int main()
{
int i,j,a,b;
fin>>n>>m;
for (i=1; i<=n; i++)
fin>>dp[0][i];
while ((1<<x)<=n)
x++;
for (i=1; i<x; i++)
{
for (j=1; j<=n-(1<<i)+1; j++)
{
dp[i][j]=min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
}
}
for (i=1; i<=m; i++)
{
fin>>a>>b;
int l=b-a+1;
x=0;
while ((1<<x)<=l)
x++;
x--;
fout<<min(dp[x][a],dp[x][b-(1<<x)+1])<<"\n";
}
return 0;
}