Cod sursa(job #973283)
Utilizator | Data | 13 iulie 2013 22:04:38 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,x,y,a[100010],i,min1,j;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=m;i++)
{
f>>x>>y;
min1=a[x];
for(j=x+1;j<=y;j++)
if(a[j]<min1)
min1=a[j];
g<<min1<<"\n";
}
return 0;
}