Pagini recente » Cod sursa (job #708432) | Cod sursa (job #1732707) | Cod sursa (job #1845016) | Cod sursa (job #2849328) | Cod sursa (job #2865359)
#include <iostream>
#include <fstream>
using namespace std;
int v[100005];
int r[20][100005];
int logaritm[100005];
int main()
{
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m;
fin >> n >> m;
for(int i = 0; i < n; i++){
fin >> v[i];
}
for(int i = 0; i < n; i++){
r[0][i] = v[i];
}
logaritm[1] = 0;
for (int i = 2; i <= n; i++){
logaritm[i] = 1 + logaritm[i/2];
}
int i = 1;
while((1 << i) <= n){
for(int j = (1 << i) - 1; j < n; j++){
r[i][j] = min(r[i - 1][j], r[i - 1][j - (1 << (i - 1))]);
}
i++;
}
for(i = 0; i < m; i++){
int st, dr;
fin >> st >> dr;
st--;
dr--;
int l = logaritm[dr - st + 1];
int rez = min(r[l][st + (1<<l) - 1], r[l][dr]);
fout << rez << "\n";
}
fin.close();
fout.close();
return 0;
}