Pagini recente » Cod sursa (job #2808032) | Istoria paginii runda/concursceva2/clasament | Cod sursa (job #2009214) | Cod sursa (job #2439069) | Cod sursa (job #1685260)
#include <fstream>
#define NMax 100005
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,l,x,y,diff;
int rmq[20][NMax];
int log2[NMax];
int main()
{
f >> n >> m;
// g << 1.0*(sizeof(rmq))/1024/1024 << '\n';
for(int i = 1; i <= n; ++i)
f >> rmq[0][i];
log2[1] = 0;
for(int i = 2; i <= n; ++i)
log2[i] = log2[i / 2] + 1;
for(int i = 1; (1 << i) <= n; ++i){
for(int j = 1; j <= n - (1 << i) + 1; ++j){
l = (1 << (i - 1));
rmq[i][j] = min(rmq[i - 1][j],rmq[i - 1][j + l]);
}
}
for(int i = 1; i <= m; ++i){
f >> x >> y;
diff = y - x + 1;
l = log2[diff];
g << min(rmq[l][x],rmq[l][y - (1<<l) + 1]) << '\n';
}
return 0;
}