Pagini recente » Cod sursa (job #56795) | Cod sursa (job #434493) | Cod sursa (job #722565) | Cod sursa (job #554274) | Cod sursa (job #2002700)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream in("rqm.in");
ofstream out("rqm.out");
int Minim[17][100001];
int n, m;//date intrare
void construireMatrice(){
int limita = log2(n);
for(int i = 1; i <= limita; i++)
for(int j = 1; j <= n - i; j++)
Minim[i][j] = min(Minim[i - 1][j], Minim[i - 1][j + (int) pow(2, i - 1)]);
}
int calculMinim(int a, int b){
int putere = log2(b - a);
return min(Minim[putere][a],Minim[putere][b - (int) pow(2, putere) + 1]);
}
void rezolvare(){
in >> n >> m;
for(int i = 1; i <= n ; i++)
in >> Minim[0][i];
construireMatrice();
for(int i = 1; i <= m; i++){
int a, b;
in >> a >> b;
out << calculMinim(a, b) << '\n';
}
}
int main(){
rezolvare();
return 0;
}