Pagini recente » Cod sursa (job #3277403) | Cod sursa (job #2928547) | Cod sursa (job #1953399) | Cod sursa (job #1145532) | Cod sursa (job #222953)
Cod sursa(job #222953)
#include<fstream.h>
#include<math.h>
int a[100002][18],l,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];
2
for (i=1;i<=n;i++)
a[0][i]=v[i];
for (i=1; (1 << i) <=n; i++)
for (j=1;j<=n-(1<<i)+1;j++)
{
l=1<< (i-1);
if (a[i-1][j]<=a[i-1][j+l])
a[i][j]=a[i-1][j];
else a[i][j]=a[i-1][j+l];
}
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;
int diff=y-x+1;
l=lg[diff];
int sh=diff-(1<<l);
if (a[l][x]<=a[l][x+sh]) g<<a[l][x]<<'\n';
else g<<a[l][x+sh]<<'\n';
}
f.close();
g.close();
return 0;
}