Cod sursa(job #3302641)
| Utilizator | Data | 9 iulie 2025 17:17:42 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define MAX 200001
long long int n,m,i,j,v[MAX],minn,a,b,poz=-1;
int main()
{
fin>>n>>m;
for(i=1;i<=n;++i){
fin>>v[i];
}
while(m--){
fin>>a>>b;
minn=INT_MAX;
//poz=-1;
for(i=a;i<=b;++i){
if(minn>v[i]){
minn=v[i];
//poz=i;
}
}
fout<<minn<<"\n";
}
return 0;
}