Pagini recente » Cod sursa (job #2805292) | Cod sursa (job #2656047) | Borderou de evaluare (job #2146757) | Cod sursa (job #1391797) | Cod sursa (job #2165137)
#include <fstream>
#include<iostream>
#include <cmath>
//#include <bits/stdc++.h>
#define nmax 100001
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m2,v[nmax],m[nmax][20];
int main()
{
f>>n>>m2;
for(int i=1;i<=n;i++)
{f>>v[i];m[i][0]=i;}
for(int j=1;(1<<j)<=n;j++)
for(int i=1;i+(1<<j)-1<=n;i++)
if(v[m[i][j-1]]<v[m[i+(1<<(j-1))][j-1]])
m[i][j]=m[i][j-1];
else m[i][j]=m[i+(1<<(j-1))][j-1];
int x,y;
while(f>>x>>y)
{
int k =log2(y-x+1);
if(v[m[x][k]]<=v[m[y-(1<<k)+1][k]])
g<<v[m[x][k]]<<'\n';
else g<<v[m[y-(1<<k)+1][k]]<<'\n';
}
return 0;
}