Pagini recente » Cod sursa (job #259365) | Cod sursa (job #3268291) | Cod sursa (job #123173) | Cod sursa (job #3293992) | Cod sursa (job #2623605)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int main()
{
int n,m,v[100010][18],logaritmi[100010];
int x,y,a;
f>>n>>m;
for (int i=1; i<=n; i++)
{
f>>v[i][0];
}
for(int i=2; i<=n; i++)
{
logaritmi[i]=logaritmi[i/2]+1;
}
for(int j=1; j<=logaritmi[n]; j++)
{
for(int i=1; i<=n-(1<<j)+1; i++)
{
v[i][j]=min(v[i][j-1],v[i+(1<<(j-1))][j-1]);
}
}
for (int i=1; i<=m; i++)
{
f>>x>>y;
a=logaritmi[y-x+1];
g<<min(v[x][a],v[y-(1<<a)+1][a])<<"\n";
}
return 0;
}