Cod sursa(job #1551712)
Utilizator | Draghici Razvan razvandraghici | Data | 16 decembrie 2015 13:58:37 |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int n, i, k, v[1000003], c, nr, minim=1000000, a, b, m, j;
int main()
{
ifstream fin("rmq.in");
ofstream fout("rmq.out");
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=m;i++){
fin>>a>>b;
for(j=a;j<=b;j++){
if(minim>v[j])
minim=v[j];
}
fout<<minim<<'\n';
minim=1000000;
}
return 0;
}