Pagini recente » Rezultatele filtrării | Cod sursa (job #37344) | Cod sursa (job #708293) | Cod sursa (job #1105501) | Cod sursa (job #2170170)
#include <iostream>
#include <fstream>
#define NMAX 100001
using namespace std;
int v[NMAX],doi[NMAX],t,i,n,a[NMAX][18],x,y,q,j,sol[NMAX];
ifstream f("rmq.in");
ofstream g("rmq.out");
void pre(){
for(i=1;i<=n;i++){
t=i;
while(t>=2){
t/=2;
doi[i]++;
}
}
}
int main()
{
f>>n>>q;
pre();
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
a[i][0]=v[i];
for(j=1;j<=doi[n];j++)
for(i=0;i+(1<<j)-1<=n;i++)
a[i][j]=min(a[i][j-1],a[i+(1<<(j-1))][j-1]);
for(i=1;i<=q;i++){
f>>x>>y;
g<<min(a[x][doi[y-x+1]],a[y-(1<<doi[y-x+1])+1][doi[y-x+1]])<<'\n';
}
return 0;
}