Pagini recente » Cod sursa (job #2351548) | Cod sursa (job #2813292) | Cod sursa (job #2177) | Cod sursa (job #1690729) | Cod sursa (job #2554597)
#include <fstream>
#define dim 100001
using namespace std;
int n, m, log[dim], i, j, dp[20][dim], x, y, d, k;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int main () {
fin>>n>>m;
for (i=2;i<=n;i++) {
log[i]=log[i/2]+1;
}
for (j=1;j<=n;j++) {
fin>>dp[0][j];
}
for (i=2;i<=log[n];i++) {
for (j=1;j<=n-(1<<i)+1;j++) {
dp[i][j]=min(dp[i-1][j], dp[i-1][j+(1<<(i-1))]);
}
}
for (i=1;i<=m;i++) {
fin>>x>>y;
d=x-y+1;
k=log[d];
fout<<min(dp[k][x], dp[k][y-(1<<k)+1])<<"\n";
}
return 0;
}