Cod sursa(job #1607593)
| Utilizator | Data | 21 februarie 2016 13:59:50 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<iostream>
#include<fstream>
using namespace std;
void minim(int v[100001], int i, int j, int &d)
{
d=v[i];
int k;
for(k=i+1;k<=j;k++)
{
if(d>v[k])
{
d=v[k];
}
}
}
int main()
{
int i,j,k,N,M,v[100001],d;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
fin>>N>>M;
for(i=1;i<=N;i++)
{
fin>>v[i];
}
for(k=1;k<=M;k++)
{
fin>>i>>j;
minim(v,i,j,d);
fout<<d<<'\n';
}
fin.close();
fout.close();
return 0;
}
