Pagini recente » Cod sursa (job #2614815) | Cod sursa (job #2594369) | Cod sursa (job #3142402) | Cod sursa (job #2598704) | Cod sursa (job #3179773)
#include <fstream>
#include <vector>
using namespace std;
const int nmax = 100005;
int dp[18][nmax], Log2[nmax];
int n, m;
void precalcul(){
Log2[1] = 0;
for(int i = 2; i <= nmax; i++){
Log2[i] = Log2[i / 2] + 1;
}
for(int p = 1; p <= 17; p++){
for(int i = 1; i <= n; i++){
dp[p][i] = min(dp[p - 1][i], dp[p - 1][i + (1 << (p - 1))]);
}
}
}
int main(){
ifstream f("rmq.in");
ofstream g("rmq.out");
f >> n >> m;
for(int i = 1; i <= n; i++){
f >> dp[0][i];
}
precalcul();
while(m--){
int x, y;
f >> x >> y;
int putere = Log2[y - x + 1];
g << min(dp[putere][x], dp[putere][y - (1 << putere) + 1]) << '\n';
}
}