Mai intai trebuie sa te autentifici.
Cod sursa(job #2017984)
Utilizator | Data | 3 septembrie 2017 10:05:33 | |
---|---|---|---|
Problema | Range minimum query | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.2 kb |
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <deque>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define pb push_back
const int NMax = 1e5 + 5;
const int sMax = 1e3 + 5;
const int strMax = 7*NMax + 50;
const int inf = 1e9 + 5;
int N,M;
int v[NMax],rmq[sMax],idx[NMax],rem[NMax];
int main() {
in>>N>>M;
int root = 1;
for (;root*root <= N;++root);
--root;
for (int i=1;i*root <= N;++i) {
rmq[i] = inf;
}
for (int i=1;i <= N;++i) {
in>>v[i];
idx[i] = (i-1)/root + 1;
rem[i] = (i-1)%root;
rmq[idx[i]] = min(rmq[idx[i]],v[i]);
}
while (M--) {
int a,b;
in>>a>>b;
int ans = inf, i = a;
while (i <= b && rem[i] != 0) {
ans = min(ans,v[i++]);
}
while (i+root-1 <= b) {
ans = min(ans,rmq[idx[i]]);
i += root;
}
while (i <= b) {
ans = min(ans,v[i++]);
}
out<<ans<<'\n';
}
in.close();out.close();
return 0;
}