Mai intai trebuie sa te autentifici.
Cod sursa(job #1690167)
Utilizator | Data | 14 aprilie 2016 20:33:13 | |
---|---|---|---|
Problema | Range minimum query | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define INF numeric_limits<int>::max()
#define int64 long long
#define lsb(x) (-x)&(x)
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int dp[19][100010],n,lg[100010],Q;
int main()
{
in>>n>>Q;
for(int i=1;i<=n;i++)
{
in>>dp[0][i];
if(i>=2)
lg[i]=lg[i/2]+1;
}
for(int i=1;(1<<i)<=n;i++)
for(int j=1;j<=n-(1<<(i-1));j++)
dp[i][j]=min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
for(;Q;Q--)
{
int x,y;
in>>x>>y;
int diff=y-x+1;
out<<min( dp[ lg[diff] ][x] , dp[ lg[diff] ][y-(1<<lg[diff])+1])<<'\n';
}
return 0;
}