Pagini recente » Cod sursa (job #2298131) | Cod sursa (job #3207320) | Cod sursa (job #1480995) | Cod sursa (job #2246464) | Cod sursa (job #2891052)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,q,i,v[100005],m[100002][99],k,j,x,y;
void create_matrix()
{
int ok=0;
for(int i=1;i<=n;i++)
m[i][0]=v[i];
for(int i=1;i<=n&&ok==0;i++)
{
if((1<<i)<=n)
{
for(int j=1;j+(1<<i)-1<=n;j++)
{
m[j][i]=min(m[j][i-1],m[j+(1<<(i-1))][i-1]);
}
}
else
ok=1;
}
}
int query(int start,int stop)
{
int l=stop-start+1,p=0;
while((1<<(p+1))<=l)
{
p++;
}
return min(m[start][p],m[stop-(1<<p)+1][p]);
}
int main()
{
f>>n>>q;
for(i=1;i<=n;i++)
{
f>>v[i];
}
create_matrix();
for(i=1;i<=q;i++)
{
f>>x>>y;
g<<query(x,y)<<'\n';
}
return 0;
}