Pagini recente » Cod sursa (job #2978076) | Cod sursa (job #3272972) | Cod sursa (job #1768332) | Cod sursa (job #3276931) | Cod sursa (job #2711237)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, m, dp[100009][(int)log2(100009)+2], v[100009];
void dinamica()
{
for(int i=1; i<=n; i++)
dp[i][0]=i;
int linmax, colmax=(int)log2(n), put=1;
for(int j=1; j<=colmax; j++)
{
linmax=n-(put<<1)+1;
for(int i=1; i<=linmax; i++)
{
if(v[dp[i][j-1]]<v[dp[i+put][j-1]])
dp[i][j]=dp[i][j-1];
else dp[i][j]=dp[i+put][j-1];
}
put<<=1;
}
}
void afisare()
{
int st, dr;
for(int i=0; i<m; i++)
{
f>>st>>dr;
int lg=log2(dr-st+1);
g<<min(v[dp[st][lg]], v[dp[dr-(1<<lg)+1][lg]])<<'\n';
}
}
int main()
{
f>>n>>m;
for(int i=1; i<=n; i++)
f>>v[i];
dinamica();
afisare();
return 0;
}