Pagini recente » Cod sursa (job #2438215) | Cod sursa (job #3139680) | Cod sursa (job #3240253) | Cod sursa (job #2157004) | Cod sursa (job #2164802)
#include <fstream>
#define nmax 100001
#define inf 2e9
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m1,v[nmax],i,m[nmax][20],l,lg,mn,nr,j,x,y,diff;
int main()
{
f>>n>>m1;
for(i=1;i<=n;i++) f>>v[i];
for(i=1;i<=n;i++) m[i][0]=i;
for(j=1;(1<<j)<=n;j++)
for(i=1;i<=n-(1<<j)+1;i++)
if(v[m[i][j-1]]<v[m[i+(1<<(j-1))][j-1]]) m[i][j]=m[i][j-1];
else m[i][j]=m[i+(1<<(j-1))][j-1];
for(i=1;i<=m1;i++)
{
f>>x>>y;
diff=y-x+1;
l=(int)log2(diff);
if(l)
if(v[m[x][l-1]]<v[m[x+(1<<(l-1))][l-1]]) g<<v[m[x][l-1]]<<'\n';
else g<<v[m[x+(1<<(l-1))][l-1]]<<'\n';
else g<<v[m[x][l]]<<'\n';
}
return 0;
}