Pagini recente » Cod sursa (job #371771) | Cod sursa (job #1930983) | Cod sursa (job #298802) | Cod sursa (job #717405) | Cod sursa (job #3149309)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
long long p2[17];
int lg[100001];
int rmq[100001][17];
int main(){
p2[0] = 1;
int v[100001];
int n, m;
fin >> n >> m;
for (int i = 1; i <= 16; i++) {
p2[i] = p2[i-1] * 2;
}
for (int i = 2; i <= n; i++){
lg[i] = lg[i / 2] + 1;
}
for (int i = 1; i <= n; i++){
fin >> v[i];
rmq[i][0] = v[i];
}
for (int j = 1; j <= lg[n]; j++){
for (int i = 1; i + p2[j] - 1 <= n; i++){
rmq[i][j] = min(rmq[i][j - 1], rmq[i + p2[j-1]][j - 1]);
}
}
for (int i = 1; i <= m; i++){
int st, dr;
fin >> st >> dr;
int len = dr - st + 1;
int log = lg[len];
fout << min(rmq[st][log], rmq[dr - p2[log] + 1][log]) << '\n';
}
return 0;
}