Pagini recente » Cod sursa (job #2075746) | Cod sursa (job #2854533) | Istoria paginii runda/cautare-binara-mars/clasament | Cod sursa (job #2060569) | Cod sursa (job #2864716)
#include <bits/stdc++.h>
#define NMAX 100005
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int a[NMAX], dp[25][NMAX], lg[NMAX];
int n, m;
int main()
{
int i, j, x, y;
fin>>n>>m;
for (i=1; i<=n; i++)
fin>>a[i];
lg[1]=0;
for (i=2; i<=NMAX-5; i++)
lg[i]=lg[i/2]+1;
for (i=1; i<=n; i++)
dp[i][0] = a[i];
for (j=1; (1<<j)<=n; j++)
for (i=1; i<=n-(1<<j)+1; i++)
dp[i][j]=min(dp[i][j-1], dp[i+(1<<(j-1))][j-1]);
for (i=1; i<=m; i++)
{
fin>>x>>y;
int len=y-x+1;
len = lg[len];
fout << min(dp[x][len], dp[y - (1 << len) + 1][len]) << "\n";
}
return 0;
}