Pagini recente » Cod sursa (job #1681883) | Cod sursa (job #394650) | Cod sursa (job #321769) | Istoria paginii runda/sim_oni_2010_ziua2 | Cod sursa (job #2892145)
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int main()
{
int v[1000],n,m,minima[100][100];
fin>>n>>m;
for(int i = 1; i <= n; i++){
fin>>v[i-1];
minima[i-1][0] = v[i-1];
}
///RMQ
for(int j = 1; (1<<(j-1)) < n; j++){
for(int i = 0; i < n+1-(1<<j); i++){
minima[i][j] = min(minima[i][j-1], minima[i+(1<<(j-1))][j-1]);
}
}
/*
for(int i = 0; i <n;i++){
for(int j = 0; j<n; j++){
cout<<minima[i][j]<<" ";
}
cout<<endl;
}*/
///Rezolvarea query-urilor - O(1)
for(int i = 1; i <= m; i++){
int x,y;
fin>>x>>y;
if(y<x) swap(x,y);
int lungime = y-x+1;
int aux = log2(lungime);
///cout<<x<<" "<<y<<" "<<aux<<" "<<min(minima[aux][x], minima[aux][y-(1<<aux)])<<endl;
fout<<min(minima[x][aux], minima[y-(1<<aux)][aux])<<endl;
}
fin.close();
fout.close();
return 0;
}