Cod sursa(job #2766190)
| Utilizator | Data | 31 iulie 2021 12:33:26 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int n, sol[10005][10005];
int m, st, dr;
int main (){
fin>>n>>m;
for(int i=1; i<=n; i++)
fin>>sol[i][i];
for(int i=1; i<=n; i++)
for(int j=i+1; j<=n; j++)
sol[i][j] = min(sol[i][j-1], sol[j][j]);
for(int i=1; i<=m; i++){
fin>>st>>dr;
fout<<sol[st][dr]<<"\n";
}
return 0;
}
