Cod sursa(job #1363713)
Utilizator | Data | 27 februarie 2015 10:26:26 | |
---|---|---|---|
Problema | Range minimum query | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in("rmq.in");
ofstream out("rmq.out");
long int x, y, i, j, n, m, v[100000], minim;
in>>n>>m;
for(i=1;i<=n;i++)
{
in>>v[i];
}
for(i=1;i<=m;i++)
{
in>>x>>y;
minim=100001;
for(j=x;j<=y;j++)
if(v[j]<minim) minim=v[j];
out<<minim;
}
in.close();
out.close();
return 0;
}