Pagini recente » Cod sursa (job #3282417) | Cod sursa (job #3158628) | Cod sursa (job #576098) | Cod sursa (job #1321906) | Cod sursa (job #2283108)
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
#define min(a,b) ((a<b)?a:b)
int n,b[100],rmq[100][100],lg[100],l;
void calcrmq(){
int i,j;
lg[1]=0;
for(i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(i=1;i<=n;i++)
rmq[0][i]=b[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] );
}
}
int main()
{
int m,i,j;
f>>n>>m;
for(i=1;i<=n;i++)
f>>b[i];
calcrmq();
for(i=1;i<=n;i++)
g<<rmq[0][i]<<" ";
g<<"\n";
for(i=1;(1<<i)<=n;i++)
{
for(j=1;j<=n-(1<<i)+1;j++)
g<<rmq[i][j]<<" ";
g<<"\n";
}
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])<<"\n";
}
return 0;
}