Cod sursa(job #1664927)
Utilizator | Data | 26 martie 2016 15:07:21 | |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,i,j,lg[100005],a[100005][20],x,y,l;
int main ()
{f>>n>>m;for(i=1;i<=n;i++) f>>a[i][0];
for(j=1;(1<<j)<n;j++)
for(i=1;i+(1<<j)<=n+1;i++)
{a[i][j]=min(a[i][j-1],a[i+(1<<(j-1))][j-1]);}
lg[1]=0; for(i=2;i<=n;i++) lg[i]=lg[i/2]+1; while(m){f>>x>>y;l=y-x; l=lg[l];g<<min(a[x][l],a[y-(1<<l)+1][l])<<'\n';m--;}
return 0;
}