Pagini recente » Cod sursa (job #3005285) | Borderou de evaluare (job #1036387) | Cod sursa (job #2916636) | Cod sursa (job #2769814) | Cod sursa (job #3133863)
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[100000][20],v[100000];
void RMQ1(int N)
{
int i,j,a;
for(i=0; i<N; i++)
rmq[i][0]=v[i];
for(i=1; pow(2,i)<N+1; i++)
{
for(j=0; pow(2,i)+j<N+1; j++)
{
int a=i-1;
rmq[j][i]=min(rmq[(1<<i-1)+j][i-1],rmq[j][i-1]);
}
}
}
int main()
{
int i,j,a,b,N, M,c,a1,b1;
fin>>N>>M;
for(i=0; i<N; i++)
fin>>v[i];
RMQ1(N);
for(i=0; i<M; i++)
{
fin>>a>>b;
c= log2(b-a+1);
if(rmq[a-1][c]<=rmq[b-(1<<c)][c])
fout<<rmq[a-1][c];
else
fout<<rmq[b-(1<<c)][c];
fout<<"\n";
}
fin.close();
fout.close();
return 0;
}