Pagini recente » Cod sursa (job #1590033) | Cod sursa (job #970937) | Cod sursa (job #1764026) | Cod sursa (job #1121885) | Cod sursa (job #3254066)
#include <fstream>
using namespace std;
int v[100005][17], l[100005];
int main() {
int n, m, i, j, x, y, dist;
ifstream fin( "rmq.in" );
ofstream fout( "rmq.out" );
fin >> n >> m;
for (i = 0; i < n; i++) {
fin >> v[i][0];
}
for (i = 2; i <= n; i++) {
l[i] = l[i / 2] + 1;
}
for (j = 1; ( 1 << j ) <= n; j++ ) {
for (i = 0; i + ( 1 << j ) - 1 < n; i++) {
v[i][j] = min( v[i][j - 1], v[i + ( 1 << ( j - 1 ) )][j - 1] );
}
}
for (i = 0; i < m; i++) {
fin >> x >> y;
x--;
y--;
dist = l[y - x + 1];
fout << min( v[x][dist], v[y - ( 1 << dist ) + 1][dist] ) << '\n';
}
return 0;
}