Pagini recente » Cod sursa (job #806402) | Cod sursa (job #1584588) | Cod sursa (job #2805950) | Cod sursa (job #1194675) | Cod sursa (job #3247395)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m;
int log_2[int(1e5) + 5];
int v[int(1e5) + 5];
int rmq[int(1e5) + 5][30];
int main(){
fin >> n >> m;
for (int i = 2; i <= n; i++){
log_2[i] = log_2[i / 2] + 1;
}
for (int i = 1; i <= n; i++){
fin >> v[i];
rmq[i][0] = v[i];
}
for (int j = 1; j <= log_2[n]; j++){
for (int i = 1; i <= n - (1 << (j - 1)); i++){
int cealalta_jumate = i + (1 << (j - 1));
rmq[i][j] = min(rmq[i][j - 1], rmq[cealalta_jumate][j - 1]);
}
}
for (int i = 1; i <= m; i++){
int a, b;
fin >> a >> b;
int logaritm = log_2[b - a + 1];
int cealalta_jumate = b - (1 << logaritm) + 1;
int ans = min(rmq[a][logaritm], rmq[cealalta_jumate][logaritm]);
fout << ans << '\n';
}
return 0;
}