Pagini recente » Cod sursa (job #2347349) | Cod sursa (job #396108) | Cod sursa (job #2552554) | Cod sursa (job #1202027) | Cod sursa (job #692559)
Cod sursa(job #692559)
#include<fstream>
#include<math.h>
#define lim 100001
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,A[22][lim],pr[lim],i,j,x,y,t;
int min(int a,int b){
if(a<b)
return a;
return b;
}
void rmq(){
for(i=2;i<=n;i++)
pr[i]=pr[i/2]+1;
for(i=1;(1<<i)<=n ;i++){
for(j=1; j+(1<<i)-1<=n;j++){
A[i][j]=min( A[i-1][j],A[i-1][j+(1<<(i-1))] );
}
}
for(i=1;i<=m;i++){
f>>x>>y;
t=pr[y-x+1];
g<<min(A[t][x] , A[t][y+1-(1<<t)])<<"\n";
}
}
int main (){
f>>n>>m;
for(i=1;i<=n;i++)
f>>A[0][i];
rmq();
return 0;
}