Pagini recente » Profil investAdofe | Cod sursa (job #992204) | Cod sursa (job #1373848)
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int N, M, rmq[20][100005], lg[100005], st, dr, dif, log;
int main()
{
f>>N>>M;
for (int i=1; i<=N; ++i)
f>>rmq[0][i];
for (int i=2; i<=N; ++i)
lg[i]=lg[i/2]+1;
for (int i=1; (1<<i)<=N; ++i)
for (int j=1; j<=N-(1<<i)+1; ++j)
rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
while (M--)
{
f>>st>>dr; log=lg[dr-st+1];
g<<min(rmq[log][st], rmq[log][dr-(1<<log)+1])<<'\n';
}
return 0;
}