Cod sursa(job #2345391)
| Utilizator | Data | 16 februarie 2019 12:16:45 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#define lgmax 30
#define nmax 100002
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int a[lgmax][nmax];
int lg[nmax];
int main()
{
int n,m,x,y;
fin>>n>>m;
for(int i=1;i<=n;i++)
fin>>a[0][i];
for(int i=2;i<=n;i++)
lg[i]=lg[i/2]+1;
for(int i=1;(1<<i)<n;i++)
for(int j=1;j<=n-(1<<(i-1));j++)
a[i][j]=min(a[i-1][j],a[i-1][j+(1<<i-1)]);
for(int i=1;i<=m;i++)
{
fin>>x>>y;
fout<<min(a[lg[y-x+1]][y+1-(1<<(lg[y-x+1]))],a[lg[y-x+1]][x])<<"\n";
}
return 0;
}
