Pagini recente » Cod sursa (job #1713025) | Cod sursa (job #1031619) | Cod sursa (job #1246368) | Cod sursa (job #22013) | Cod sursa (job #2625844)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int rmq[18][100001];
int n, m;
int lg[100002];
int a[100002];
int i, j, l;
int main()
{
ifstream f("rmq.in");
ofstream g("rmq.out");
f>>n>>m;
for (i=1; i<=n; i++)
f>>a[i];
lg[1]=0;
for (i=2; i<=n; i++)
lg[i] = lg[i/2]+1;
for (i=1; i<=n; i++)
rmq[0][i] = a[i];
for (i=1; (1 << i) <=n; i++)
for (j=1; j <= n - (1 << i)+1; j++)
{
l = 1 << (i-1);
rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j+l]);
}
long int x, y, diff, sh;
for (i=1; i<=m; i++)
{
f>>x>>y;
diff = y - x + 1;
l = lg[diff];
sh = diff - (1<<l);
cout<<min(rmq[l][x],rmq[l][x+sh])<<"\n";
}
return 0;
}