Cod sursa(job #1013738)
Utilizator | Data | 21 octombrie 2013 17:35:01 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int a[100001],n,m,min1=0;
void fmin(int x,int y)
{
min1=a[x];
for(int i=x;i<=y;i++)
min1=min(min1,a[i]);
g<<min1<<"\n";
}
int main()
{
int i,x,y;
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>a[i];
}
for(i=1;i<=m;i++)
{
min1=0;
f>>x>>y;
fmin(x,y);
}
return 0;
}