Cod sursa(job #1637885)
Utilizator | Data | 7 martie 2016 19:50:26 | |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
using namespace std;
int n, m, i, j, x[18][100005], y[100005], p, a, b;
ifstream in("rmq.in");
ofstream out("rmq.out");
int main()
{
in>>n>>m;
for(i=1; i<=n; i++)
in>>x[0][i];
for(i=1; (1<<i)<=n; i++)
{
for(j=1; j<=n; j++)
{
x[i][j]=min(x[i-1][j], x[i-1][j+(1<<(i-1))]);
}
}
for(i=2; i<=n; i++)
y[i]=1+y[i/2];
for(;m--;)
{
in>>a>>b;
p=y[b-a+1];
out<<min(x[p][a], x[p][b-(1<<p)+1])<<"\n";
}
return 0;
}