Cod sursa(job #876880)
Utilizator | Data | 12 februarie 2013 11:36:55 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<iostream>
#include<fstream>
#define nmax 1000000
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int main()
{
int x,y,n,m,a[nmax],i,j;
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=m;i++)
{
f>>x>>y;
int k = nmax;
for(j=x;j<=y;j++)
if(a[j]<k) k=a[j];
g<<k<<endl;
}
g.close();
f.close();
return 0;
}