Pagini recente » Cod sursa (job #2421953) | Rating Stefan Bordeianu (sbordeianu) | Cod sursa (job #2620321) | Cod sursa (job #2146494) | Cod sursa (job #877254)
Cod sursa(job #877254)
#include <vector>
#include <fstream>
using namespace std;
#define nmax 100010
#define lmax 20
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, m, v[nmax], rmq[nmax][lmax], lg[nmax];
int main() {
f >> n >> m;
for(int i=0; i<n; i++) {
f >> v[i];
rmq[i][0] = i;
}
for(int j=1; (1<<j)<=n; j++)
for(int i=0; i+(1<<j)-1<n; i++)
if( v[ rmq[i][j-1] ] < v[ rmq[i+(1<<(j-1))][j-1] ] )
rmq[i][j] = rmq[i][j-1];
else
rmq[i][j] = rmq[i+(1<<(j-1))][j-1];
for(int i=2; i<=n; i++)
lg[i] = lg[i>>1] + 1;
for(int i=0; i<m; i++) {
int x, y;
f>>x>>y;
x--; y--;
int k = lg[y-x+1];
g<<min(v[rmq[x][k]],v[rmq[y-(1<<k)+1][k]]) << '\n';
}
return 0;
}