Pagini recente » Borderou de evaluare (job #1684695) | Cod sursa (job #1684724) | Concursuri Virtuale | Cod sursa (job #2512131)
#include <iostream>
#include <fstream>
#include <vector>
#include <math.h>
using namespace std;
ifstream in ("rmq.in");
ofstream out("rmq.out");
int mm[100005][40];
int lg2[100010];
int n, m;
int x1, x2;
int main()
{
in>>n>>m;
lg2[1]=0;
for(int i=2; i<=n; i++)
lg2[i]=lg2[i>>1]+1;
for(int i=0; i<n; i++)
in>>mm[i][0];
for(int put=1; (1<<put)<=n; put++)
for(int i=0; i+(1<<put)-1<n; i++)
mm[i][put]=min(mm[i][put-1], mm[i+(1<<(put-1))][put-1]);
for(int i=1; i<=m; i++)
{
in>>x1>>x2;
int poz=(int)lg2[x2-x1+1];
out<<min(mm[x1-1][poz], mm[x2-1-(1<<poz)+1][poz])<<"\n";
}
return 0;
}