Pagini recente » Cod sursa (job #1780739) | Cod sursa (job #52426) | Cod sursa (job #414427) | Cod sursa (job #2148486) | Cod sursa (job #3121191)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int logg = 15;
//modif logg
int v[100005],rmq[10005][18],i,j,n,q,p,st,dr,lungime,put=1,logaritm,m,val1,val2,Min=1000005,puteri[10005];
int main()
{
fin>>m>>q;
logaritm = log2(m);
puteri[0] = 1;
while(puteri[i] <= m){
puteri[++i] = i * logaritm;
}
//m atentie
for(i=1;i<=m;i++){
fin>>v[i];
Min = min(Min,v[i]);
if(i % logaritm == 0){
n++;
rmq[n][0] = Min;
Min=1000005;
}
}
for(p=1;p<=logg;p++){
for(i=1;i<=n;i++){
if(i+put <= n){
rmq[i][p] = min(rmq[i][p-1],rmq[i+put][p-1]);
}
}
put <<= 1;
}
for(i=1;i<=q;i++){
fin>>st>>dr;
fout << Min << '\n';
}
return 0;
}