Cod sursa(job #1435486)
Utilizator | Data | 13 mai 2015 16:48:45 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("rmq.in");
ofstream g ("rmq.out");
int a[100001],n,m,i,min1,x,y,j;
cout<<"n="; f>>n;
cout<<"m="; f>>m;
for (i=1;i<=n;i++)
f>>a[i];
for (i=1;i<=m;i++)
{f>>x;
f>>y;
min1=999999;
for (j=x;j<=y;j++)
{if (a[j]<min1)
min1=a[j];}
g<<min1<<endl;}
return 0;
}