Pagini recente » Cod sursa (job #370613) | Cod sursa (job #1387838) | Cod sursa (job #2271433) | Monitorul de evaluare | Cod sursa (job #1503438)
#include<fstream>
using namespace std;
int n, m, i, j, x, y, p, v[100003], d[17][100003];
ifstream in("rmq.in");
ofstream out("rmq.out");
int main()
{
in>>n>>m;
for(i=2; i<=n; i++)
v[i]=1+v[i/2];
for(i=1; i<=n; i++)
in>>d[0][i];
for(i=1; (1<<i)<=n; i++)
{
for(j=1; j<=n; j++)
{
d[i][j]=min(d[i-1][j], d[i-1][j+(1<<(i-1))]);
}
}
for(i=1; i<=m; i++)
{
in>>x>>y;
p=v[y-x];
out<<min(d[p][x], d[p][y-(1<<p)+1])<<"\n";
}
return 0;
}