Pagini recente » Cod sursa (job #2502342) | Cod sursa (job #1897683) | Cod sursa (job #1447691) | Cod sursa (job #3191688) | Cod sursa (job #2639332)
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,lg[100005];
int d[18][100005];
int main()
{
f>>n>>m;
for(int i=1; i<=n; i++)
f>>d[0][i];
for(int i=2; i<=n; i++)///log2
lg[i]=lg[i/2]+1;
for(int i=1; i<=lg[n]; i++)
for(int j=1; j+(1<<i)-1<=n; j++)
d[i][j]=min(d[i-1][j],d[i-1][j+(1<<i-1)]);
for(; m; m--)
{
int x,y;
f>>x>>y;
int nr=lg[y-x];
g<<min(d[nr][x],d[nr][y-(1<<nr)+1])<<"\n";
}
return 0;
}