Cod sursa(job #2227445)
Utilizator | Data | 31 iulie 2018 19:14:09 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int main()
{
unsigned long long int n,v[100000],m,x,y,i,j,min;
f>>n>>m;
for (i=1; i<=n; i++)
f>>v[i];
for (i=1; i<=m; i++)
{
f>>x>>y;
min=v[x];
for (j=x; j<=y; j++)
if (v[j]<min)
min=v[j];
g<<min<<'\n';
}
return 0;
}