Pagini recente » Cod sursa (job #1185080) | Cod sursa (job #74465) | Cod sursa (job #293598) | Monitorul de evaluare | Cod sursa (job #2684233)
#include <bits/stdc++.h>
using namespace std;
ifstream f ("rmq.in");
ofstream g ("rmq.out");
int n,m;
int dp[25][100005];
void citire ()
{
f>>n>>m;
for(int i=1;i<=n;++i)
f>>dp[0][i];
}
void rezolvare()
{
for(int i=1;i<=log2(n);++i)
{
for(int j=1;j+(1<<i)-1<=n;j++)
{
dp[i][j]=min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
}
}
}
int main()
{
citire();
rezolvare();
for(int i=1;i<=m;++i)
{
int a,b;
f>>a>>b;
int x=log2(b-a+1);
g<<min(dp[x][a],dp[x][b-(1<<x)+1])<<"\n";
}
return 0;
}