Cod sursa(job #991024)

Utilizator Anca_PaneaPanea Anca Anca_Panea Data 29 august 2013 14:38:19
Problema Range minimum query Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.01 kb
using namespace std;
#include<fstream>
#include<cstdio>
//ifstream eu("rmq.in");
ofstream tu("rmq.out");
#define Nmax 100005
#define DIM 8192
int Log2[Nmax],RMQ[20][Nmax],N,M;
char ax[DIM+16];
int pz;
 
inline void cit(int &x)
{
    x=0;
    while(ax[pz]<'0' || ax[pz]>'9')
        if(++pz==DIM)fread(ax, 1, DIM, stdin), pz=0;
    while(ax[pz]>='0' && ax[pz]<='9')
    {
        x=x*10+ax[pz]-'0';
        if(++pz==DIM)fread(ax,1, DIM, stdin),pz=0;
    }
}
void read()
{
	//eu>>N>>M;
	freopen("rmq.in","r",stdin);
	cit(N);cit(M);
	for(int i=1;i<=N;i++)
		//eu>>RMQ[0][i];
		cit(RMQ[0][i]);
	for(int i=2;i<=N;i++)
		Log2[i]=Log2[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)]);
}
void solve()
{
	int x,y,dist,k,minim;
	while(M--)
	{
		//eu>>x>>y;
		cit(x);cit(y);
		dist=y-x+1;
		k=Log2[dist];
		minim=min(RMQ[k][x],RMQ[k][y-(1<<k)+1]);
		tu<<minim<<"\n";
	}
}
int main()
{
	read();
	solve();
	return 0;
}