Pagini recente » Cod sursa (job #1936345) | Cod sursa (job #2287383) | Cod sursa (job #2310081) | Cod sursa (job #1622744) | Cod sursa (job #1255143)
#include <fstream>
using namespace std;
int a[100200],n,i,q,l1,l2;
ifstream f("rmq.in");
ofstream g("rmq.out");
int dividet(int x,int y)
{
int z,o;
if (y-x==0) return a[x];
else if (y-x==1) return min(a[y],a[x]);
else
{
z=dividet(x,(x+y)/2);
o=dividet((x+y)/2+1,y);
return min(z,o);
}
}
int main()
{
f>>n>>q;
for (i=1;i<=n;i++)
f>>a[i];
for (i=1;i<=q;i++)
{
f>>l1>>l2;
g<<dividet(l1,l2)<<'\n';
}
return 0;
}