Pagini recente » Cod sursa (job #970878) | Cod sursa (job #1446935) | Cod sursa (job #1067809) | Cod sursa (job #2709083) | Cod sursa (job #877030)
Cod sursa(job #877030)
#include<iostream>
#include<fstream>
#define nmax 1000000
#define lmax 18
#include<vector>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int main()
{
int n,m,a[nmax],l,i,j,lg[lmax],rmq[lmax][lmax];
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 long 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]));
}
return 0;
}