Cod sursa(job #1434920)
Utilizator | MciprianM MciprianM | Data | 11 mai 2015 17:35:35 |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
static const int MAXN = 100009;
static const int INF = 0x3F3F3F3F;
int n, m;
int v[MAXN];
int main()
{
int x, y;
ifstream f("rmq.in");
ofstream g("rmq.out");
f >> n >> m;
for(int i = 1; i <= n; i++)
{
f >> v[i];
}
for(int i = 0; i < m; i++)
{
f >> x >> y;
int ans = INF;
for(int j = x; j <= y; j++)
{
ans = min(ans, v[j]);
}
g << ans << '\n';
}
f.close();
g.close();
return 0;
}