Pagini recente » Cod sursa (job #1741561) | Cod sursa (job #2650961) | Cod sursa (job #1450753) | Cod sursa (job #289160) | Cod sursa (job #2998607)
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int main()
{
int min_v, mj, k, i, n, m, v[100005], rmq[20][100005], j, st, dr, l;
cin >> n >> m;
for(i = 1; i <= n; i++){
cin >> v[i];
rmq[0][i] = v[i];
}
for(i = 1; (1 << i) <= n ; i++){
for(j = 1; j + (1 << i) - 1 <= n; j++){
rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
}
}
/*for(i = 0; (1 << i) <= n ; i++){
for(j = 1; j + (1 << i) - 1 <= n; j++){
cout << rmq[i][j] << " " ;
}
cout << endl;
} */
for(k = 1; k <= m; k++){
cin >> st >> dr;
l = dr - st + 1;
min_v = 100001;
i = 20;
do{
while((1 << i) > l){
i--;
}
if(rmq[i][st] < min_v){
min_v = rmq[i][st];
}
st = st + (1 << i);
l = dr - st + 1;
}while(st <= dr);
cout << min_v << '\n';
}
return 0;
}