Cod sursa(job #2450275)
| Utilizator | Data | 22 august 2019 15:33:15 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#define inf 2000000000
#define NMAX 100000
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, m, a[10001][10001], v[10001];
int main()
{
f >> n >> m;
for(int i=1; i<=n; i++) f >> v[i];
for(int i=1; i<=n; i++)
for(int j=i; j<=n; j++)
{ a[i][j] = inf;
for(int k=i; k<=j; k++)
a[i][j] = min(a[i][j], v[k]);
}
while(m--)
{ int p1, p2;
f >> p1 >> p2;
g << a[p1][p2] << '\n';
}
return 0;
}
