Pagini recente » Cod sursa (job #1126035) | Cod sursa (job #1488025) | Cod sursa (job #2216969) | Cod sursa (job #1571272) | Cod sursa (job #2118134)
#include <iostream>
#include <fstream>
#include <vector>
#include <math.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, m, rmq[100002][18], lg[18];
int main()
{
int i, j, x, y;
f>>n>>m;
for (i=1; i<=n; i++)
f>>rmq[i][0];
lg[0]=1;
for (i=0; lg[i]<=n; i++)
lg[i+1]=lg[i]*2;
for (j=1; lg[j]<=n; j++)
for (i=1; i+lg[j-1]<=n; i++)
rmq[i][j]=min(rmq[i][j-1], rmq[i+lg[j-1]][j-1]);
for (i=1; i<=m; i++)
{
f>>x>>y;
for (j=0; lg[j]<=y-x+1; j++);
j--;
if (j!=0)
g<<min(rmq[x][j],rmq[y-lg[j]+1][j])<<"\n";
else
{
if(y-x==1)
g<<rmq[x][1]<<"\n";
else
g<<rmq[x][0]<<"\n";
}
}
return 0;
}