Cod sursa(job #1435141)
Utilizator | Data | 12 mai 2015 11:39:44 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int NMAX=100010;
int n,intrebari,i,j,a,b,x;
int v[NMAX];
int main()
{
in>>n>>intrebari;
for(i=1;i<=n;i++)
{
in>>v[i];
}
for(i=1;i<=intrebari;i++)
{
in>>a>>b;
x=v[a];
for(j=a+1;j<=b;j++)
{
x=min(v[j],x);
}
out<<x<<'\n';
}
in.close();
out.close();
return 0;
}