Pagini recente » Cod sursa (job #172782) | Cod sursa (job #1471002) | Cod sursa (job #1429509) | Cod sursa (job #2547698) | Cod sursa (job #2503122)
#include <fstream>
using namespace std;
int rmqq[18][100005], logusbogus[100005];
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int main()
{
int i, n, m, j, p, q, k;
cin >> n >> m;
for (i=1; i<=n; i++)
cin >> rmqq[0][i];
logusbogus[1]=0;
for(i=2;i<=n;i++)
logusbogus[i]=logusbogus[i>>1]+1;
for (i=1; i<=17; i++)
for (j=1; j<=n; j++)
rmqq[i][j]=min(rmqq[i-1][j],rmqq[i-1][j+(1<<(i-1))]);
for (i=1; i<=m; i++)
{
cin >> p >> q;
k=logusbogus[p-q];
cout << min(rmqq[k][p], rmqq[k][q-(1<<k)+1]) << '\n';
}
return 0;
}