Pagini recente » Cod sursa (job #3248552) | Cod sursa (job #1295300) | Cod sursa (job #3124504) | Cod sursa (job #2267901) | Cod sursa (job #2493651)
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,a,rmq[25][100005],log2[100005];
void rmqadd()
{
log2[1]=0;
for(int i=2;i<=n;i++)
log2[i]=log2[i/2]+1;
for(int i=1;i<=log2[n];i++)
for(int j=1;j<=m;j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
f>>rmq[0][i];
rmqadd();
for(int i=1;i<=m;i++)
{
int a,b;
f>>a>>b;
int k=b-a+1;
k=log2[k];
g<<min(rmq[k][a],rmq[k][b-(1<<k)+1])<<'\n';
}
return 0;
}