Cod sursa(job #1412253)
| Utilizator | Data | 1 aprilie 2015 10:53:01 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
# include <fstream>
# include <algorithm>
# define NMAX 100005
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int i,j,n,m,x,y,k,Q;
int a[20][NMAX], lg[NMAX];
int main ()
{
f>>n>>Q;
for (i=1; i<=n; ++i)
f>>a[0][i];
for (i=2; i<=n; ++i)
lg[i]=lg[i/2]+1;
for (i=1; i<=lg[n]; ++i)
for (j=1; j<=n-(1<<i)+1; ++j)
a[i][j]=min(a[i-1][j], a[i-1][j+(1<<(i-1))]);
for (i=1; i<=Q; ++i)
{
f>>x>>y;
int dif=y-x+1;
k=lg[dif];
g<<min(a[k][x], a[k][y-(1<<k)+1])<<"\n";
}
return 0;
}
