Pagini recente » Cod sursa (job #2636467) | Cod sursa (job #463022) | Cod sursa (job #526301) | Cod sursa (job #1797657) | Cod sursa (job #1917330)
#include <iostream>
#include <fstream>
using namespace std;
int a[100003], rmq[18][100003], lg[100003], n, l, sh, diff, i, j, m, x, y;
int main()
{
ifstream fin("rmq.in");
ofstream fout("rmq.out");
fin>>n>>m;
for(i=1; i<=n; i++) fin>>a[i], rmq[0][i]=a[i];
lg[1]=0;
for(i=2; i<=n; i++)
lg[i]=lg[i/2]+1;
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]);
}
}
for(i=1; i<=m; i++)
{
fin>>x>>y;
diff=y-x+1;
l=lg[diff];
sh=diff-(1<<l);
fout<<min(rmq[l][x], rmq[l][x+sh])<<"\n";
}
return 0;
}