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