Pagini recente » Cod sursa (job #1056798) | Cod sursa (job #600929) | Cod sursa (job #681565) | Cod sursa (job #1716055) | Cod sursa (job #2906630)
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
const int N = 1e5 + 1, LOG = log2(N) + 1;
int n, m, st, dr;
int v[N], loug[N], r[LOG][N];
void calculeazaLog(){
for(int i = 2; i <= n; i++)
loug[i] = 1 + loug[i / 2];
}
void calculeazaMatrice(){
for(int i = 1; i <= n; i++){
for(int j = 0; j <= loug[i]; j++){
if(j == 0)
r[j][i] = v[i];
else
r[j][i] = min(r[j - 1][i], r[j - 1][i - (1 << (j - 1))]);
}
}
}
int main(){
f >> n >> m;
for(int i = 1; i <= n; i++)
f >> v[i];
calculeazaLog();
calculeazaMatrice();
while(m--){
f >> st >> dr;
int p = loug[dr - st + 1];
g << min(r[p][dr], r[p][st + (1 << p) - 1]) << '\n';
}
f.close();
g.close();
}