Pagini recente » Cod sursa (job #1469229) | Cod sursa (job #2565404) | Cod sursa (job #2418571) | Cod sursa (job #694813) | Cod sursa (job #877039)
Cod sursa(job #877039)
#include<iostream>
#include<fstream>
#include<vector>
#define nmax 100002
#define lmax 18
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
long int rmq[lmax][nmax], n,m , lg[nmax], a[nmax];
int main()
{
long int i,l,j;
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[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]=a[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 x,y,dif,el;
for (i=1;i<=m;i++)
{ f>>x>>y;
dif=y-x+1;
l=lg[dif];
el=dif-(1<<l);
g<<(min(rmq[l][x],rmq[l][x+el]))<<endl;
}
return 0;}