Pagini recente » Borderou de evaluare (job #2969076) | Cod sursa (job #1967354) | Cod sursa (job #1967350) | Cod sursa (job #1967364) | Cod sursa (job #3002239)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[20][100001], log[100001];
int main()
{int n, m, a, b, d;
fin>>n>>m;
for(int i=1;i<=n;i++)
{fin>>a;
rmq[0][i]=a;
if(i!=1)log[i]=log[i/2]+1;
}
for(int i=1;i<=log[n];i++)
for(int j=1<<i;j<=n;j++)
rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j-(1<<(i-1))]);
for(int i=1;i<=m;i++)
{fin>>a>>b;
d=log[b-a+1];
fout<<min(rmq[d][a+(1<<d)-1], rmq[d][b])<<"\n";
}
return 0;
}