Pagini recente » Cod sursa (job #361697) | Cod sursa (job #1583228) | Cod sursa (job #2471979) | Cod sursa (job #47666) | Cod sursa (job #2874821)
#include <fstream>
const int PTMAX=35;
const int NMAX=100005;
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int a[PTMAX][NMAX];
int i, n, m, putere, j, x, y, gasit;
int pt(int i)
{
return (1<<i);
}
int cpt(int dif)
{
int pt=1, i=0;
while(pt<dif)
{
pt*=2;
i++;
}
if(i!=0) return i-1;
return 0;
}
int main()
{
fin>>n>>m;
for(i=1; i<=n; i++) fin>>a[0][i];
for(i=1; pt(i)<=n; i++)
{
putere=pt(i);
for(j=putere; j<=n; j++)
{
//fout<<a[i-1][j]<<' '<<a[i-1][j-(putere/2)]<<'\n';
a[i][j]=min(a[i-1][j], a[i-1][j-(putere/2)]);
//fout<<j-putere+1<<' '<<j<<' '<<a[i][j]<<'\n';
}
}
for(i=1; i<=m; i++)
{
fin>>x>>y;
gasit=cpt(y-x+1);
//fout<<gasit<<' ';
//fout<<gasit<<' '<< a[gasit][y]<<' '<<a[gasit][x+gasit]<<'\n';
fout<<min(a[gasit][y], a[gasit][x+pt(gasit)-1]);
fout<<'\n';
}
return 0;
}