Pagini recente » Arhiva de probleme | Cod sursa (job #719879) | Cod sursa (job #2183928) | Cod sursa (job #2154184) | Cod sursa (job #578436)
Cod sursa(job #578436)
#include <fstream>
using namespace std;
const int N=100002,M=18,inf=1<<30;
int a[N][M],n;
ifstream in("rmq.in");
ofstream out("rmq.out");
void RMQ()
{
for (int i=n;i;i--)
for (int j=1,k=1;i+(k<<1)<=n+1;j++,k<<=1)
a[i][j]=min(a[i][j-1],a[i+k][j-1]);
}
inline int query(int x,int y)
{
int p,q;
for (p=0,q=1;q<=y;p++,q<<=1);
q>>=1;p--;
return min(a[x][p],a[x+y-q][p]);
}
int main()
{
int t,i,x,y;
in>>n>>t;
for (i=1;i<=n;i++)
in>>a[i][0];
RMQ();
while (t--)
{
in>>x>>y;
out<<query(x,y-x+1)<<"\n";
}
return 0;
}