Cod sursa(job #1673686)
Utilizator | Data | 4 aprilie 2016 00:18:02 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream s("rmq.out");
int main()
{
long n,m,a,b,max;
f>>n>>m;
int vec[n],i,j;
for(i=0;i<n;i++)f>>vec[i];
for(i=0;i<m;i++){
f>>a>>b;max=100000;
for(j=a-1;j<b;j++)if(max>vec[j])max=vec[j];
s<<max<<endl;
}
return 0;
}