Cod sursa(job #1278109)
| Utilizator | Data | 28 noiembrie 2014 15:19:56 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#define dim 100000
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int D[18][dim+2],n,m,i,j,p[100000],a,b;
int main(){
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>D[0][i];
for(i=2;i<=n;i++)
p[i]=p[i/2]+1;
for(i=1;i<=p[n]+1;i++)
for(j=1;j<=n;j++){
D[i][j]=min(D[i-1][j],D[i-1][j+(1<<(i-1))]);
}
for(i=1;i<=m;i++){
fin>>a>>b;
fout<<min(D[p[b-a+1]][a],D[p[b-a+1]][b-(1<<(p[b-a+1]))+1])<<'\n';
}
fin.close();fout.close();
return 0;
}
