Nu exista pagina, dar poti sa o creezi ...
Cod sursa(job #2853552)
Utilizator | Data | 20 februarie 2022 13:43:03 | |
---|---|---|---|
Problema | Range minimum query | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.06 kb |
#include <fstream>
using namespace std;
#define NMAX 100000
int x, y, n, data[4 * 100001], m,minim=NMAX;
fstream cin("rmq.in", ios::in), cout("rmq.out", ios::out);
void update(int ind, int st, int dr,int i,int val)
{
if (st == dr)
{
data[ind] = val;
return;
}
int mij = (st + dr) / 2;
if(i<=mij){
update(2*ind,st,mij,i,val);
}
else{
update(2*ind+1,mij+1,dr,i,val);
}
data[ind] = min(data[2*ind],data[2*ind+1]);
}
void query(int ind, int st, int dr)
{
if (x <= st && dr <= y)
{
minim = min(minim,data[ind]);
return;
}
int mij = (st + dr) / 2;
if(x<=mij){
query(2*ind,st,mij);
}
if(mij<y){
query(2*ind+1,mij+1,dr);
}
}
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i++)
{
int k;
cin>>k;
update(1,1,n,i,k);
}
for (; m; m--)
{
minim = NMAX;
cin >> x >> y;
query(1, 1, n);
cout<<minim<<'\n';
}
return 0;
}