Mai intai trebuie sa te autentifici.
Cod sursa(job #578230)
| Utilizator | Data | 11 aprilie 2011 09:38:52 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include<fstream>
using namespace std;
#define NMAX 100002
#define LMAX 18
ifstream in("rmq.in");
ofstream out("rmq.out");
long int rmq[LMAX][NMAX];
long int n,m,i,j,l;
long int lg[NMAX];
int main()
{
in>>n>>m;
in>>rmq[0][1];
for(i=2;i<=n;i++)
{
in>>rmq[0][i];
lg[i]=lg[i/2]+1;
}
for(i=1;(1<<i)<=n;i++)
for(j=1;j<=n-(1<<i)+1;j++)
{
l=1<<(i-1);
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+l]);
}
long int x,y,diff,sh;
for(;m;m--)
{
in>>x>>y;
l=lg[(diff=y-x+1)];
sh=diff-(1<<l);
out<<min(rmq[l][x],rmq[l][x+sh])<<"\n";
}
return 0;
}
