Pagini recente » Cod sursa (job #3128606) | Cod sursa (job #2604185) | Cod sursa (job #2273381) | Cod sursa (job #1439490) | Cod sursa (job #2929679)
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,a[100001][21],b[100001],i,j,x,y;
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
f>>a[i][0];
for(int j=1;(1<<j)<=n;j++)
for(int i=1;i<=n;i++)
{
a[i][j]=a[i][j-1];
int t=i+(1<<j-1);
if(t<=n&&a[i][j]>a[t][j-1])
a[i][j]=a[t][j-1];
}
for(int i=2;i<=n;i++)
b[i]=b[i/2]+1;
for(int i=1;i<=m;i++)
{
f>>x>>y;
int d=b[y-x+1];
int t=(1<<d);
g<<min(a[x][d],a[y-t+1][d])<<'\n';
}
return 0;
}