Pagini recente » Cod sursa (job #984059) | Cod sursa (job #1537261) | Cod sursa (job #424787) | Cod sursa (job #1453881) | Cod sursa (job #222937)
Cod sursa(job #222937)
#include<fstream.h>
#include<math.h>
int a[100002][18],lg[100002],v[100002],n,m,i,j,x,y;
int main()
{
ifstream f ("rmq.in");
f>>n>>m;
for (i=1;i<=n;i++)
f>>v[i];
for (i=1;i<=n;i++)
a[0][i]=v[i];
for (i=1;pow(2,i)<=n;i++)
for (j=1;j<=n-pow(2,i-1);j++)
if (a[i-1][j]<a[i-1][j+pow(2,i-1)])
a[i][j]=a[i-1][j];
else a[i][j]=a[i-1][j+pow(2,i-1)];
lg[1]=0;
for (i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
ofstream g("rmq.out");
for (i=1;i<=m;i++)
{
f>>x>>y;
if (a[lg[y-x+1]][x]<a[lg[y-x+1]][y-pow(2,lg[y-x+1])+1]) g<<a[lg[y-x+1]][x]<<'\n';
else g<<a[lg[y-x+1]][y-pow(2,lg[y-x+1])+1]<<'\n';
}
f.close();
g.close();
return 0;
}