Pagini recente » Cod sursa (job #2382457) | Cod sursa (job #2822099) | Cod sursa (job #1631687) | Cod sursa (job #671370) | Cod sursa (job #2624252)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
long int rmq[18][18];
long int n,m;
long int lg[100002];
long int a[100002];
int main()
{
long int i,j,l;
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,diff,sh;
for (i=1;i<=m;i++)
{
f>>x>>y;
diff=y-x+1;
l=lg[diff];
sh=diff - (1<<l);
g<<min(rmq[l][x],rmq[l][x+sh]);
}
return 0;
}