Pagini recente » Cod sursa (job #1401217) | Cod sursa (job #1893438) | Cod sursa (job #341199) | Cod sursa (job #2693606) | Cod sursa (job #2887074)
#include <fstream>
const int PTMAX=35;
const int NMAX=100005;
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[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>>rmq[0][i];
for(i=1; (1<<i)<=n; i++)
{
for(j=(1<<i); j<=n; j++) rmq[i][j]=rmq[i-1][j-(1<<(i-1))]+rmq[i-1][j];
}
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(rmq[gasit][y], rmq[gasit][x+pt(gasit)-1]);
fout<<'\n';
}
return 0;
}