Pagini recente » Cod sursa (job #1186338) | Cod sursa (job #1233644) | Cod sursa (job #1084859) | Cod sursa (job #334272) | Cod sursa (job #2486061)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int r[101][101], n, log[101],m,p,q;
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
fin>>r[0][i];
log[1]=0;
for(int i=2; i<=n; i++)
log[i]=1+log[i/2];
for(int i=1; i<=log[n]; i++)
for(int j=1; j<=n; j++)
r[i][j]=min(r[i-1][j], r[i-1][j+(1<<(i-1))]);
for(int i=1;i<=m;i++)
{
fin>>p>>q;
int l=log[q-p+1];
fout<<min(r[l][p], r[l][q-(1<<l)+1]);
}
return 0;
}