Pagini recente » Cod sursa (job #2653522) | Cod sursa (job #2726127) | Cod sursa (job #379111) | Cod sursa (job #3134063) | Cod sursa (job #887307)
Cod sursa(job #887307)
#include<fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int x,y,n,m,i,j,k,log[100005],a[30][100005];
int main()
{
in>>n>>m;
for (i=1;i<=n;i++)
in>>a[0][i];
log[1]=0;
for (i=2;i<=n;i++)
log[i]=log[i/2]+1;
for (i=1;i<=log[n];i++)
for (j=1;j<=n-(1<<i)+1;j++)
a[i][j]=min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
for (i=1;i<=m;i++)
{
in>>x>>y;
k=log[y-x+1];
out<<min(a[k][x],a[k][y-(1<<k)+1])<<'\n';
}
}