Pagini recente » Cod sursa (job #2351695) | Cod sursa (job #1333419) | Cod sursa (job #1669197) | Cod sursa (job #2803042) | Cod sursa (job #711494)
Cod sursa(job #711494)
#include<fstream>
#include <vector>
using namespace std;
#define lung 100002
#define numar 18
ifstream fin("rmq.in");
ofstream fout("rmq.out");
long int rmq[numar][lung],n,m,lg[lung],v[lung];
int main()
{long int i,j,l,a,b;
fin >> n >> m;
for (i=1;i<=n;i++)
fin >> v[i];
lg[1]=0;
for (i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for (i=1;i<=n;i++)
rmq[0][i]=v[i];
for (i=1;(1<<i)<=n;i++)
for (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]);
}
long int diff,sh;
for (i=1;i<=m;i++)
{ fin >> a >> b;
diff=b-a+1;
l=lg[diff];
sh=diff - (1<<l);
fout << min(rmq[l][a],rmq[l][a+sh]) << '\n';
}
return 0;
}