Pagini recente » Cod sursa (job #2166589) | Cod sursa (job #2267869) | Cod sursa (job #1590375) | Cod sursa (job #2685588) | Cod sursa (job #1877646)
#include<fstream>
#include<cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int NMAX=100005,LOGNMAX=17;
int rmq[LOGNMAX][NMAX];
int main()
{
int n,t;
fin>>n>>t;
for(int i=1;i<=n;++i)
fin>>rmq[0][i];
for(int i=1;(1<<i)<=n;++i)
for(int j=1;j<=n-(1<<i)+1;++j)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
for(int i=1;(1<<i)<=n;++i)
{
for(int j=1;j<=n-(1<<i)+1;++j)
fout<<rmq[i][j]<<' ';
fout<<'\n';
}
/* while(t--)
{
int x,y,k;
fin>>x>>y;
k=log2(y-x);
fout<<min(rmq[k][x],rmq[k][y-(1<<k)+1])<<'\n';
}*/
}