Pagini recente » Cod sursa (job #1374372) | Cod sursa (job #2912103) | Cod sursa (job #1573487) | Cod sursa (job #1440845) | Cod sursa (job #170166)
Cod sursa(job #170166)
#include<fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define Max 100005
#define LgMax 17
int a[Max],n,m;
int rmq[LgMax][Max];
int lg[Max];
int main()
{
int i,j,k;
fin>>n>>m>>a[1];
rmq[0][1]=a[1];
for(i=2;i<=n;i++)
{
fin>>a[i];
rmq[0][i]=a[i];
lg[i]=lg[i>>1]+1;
}
for(i=1;i<=lg[n];i++)
for(j=1;j+(1<<i)-1<=n;j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
while(m--)
{
fin>>i>>j;
k=lg[j-i+1];
fout<<min(rmq[k][i],rmq[k][j-(1<<k)+1])<<'\n';
}
return 0;
}