Pagini recente » Statistici Volosciuc Edmond Roland (volosciucedmond) | Arhiva de probleme | Cod sursa (job #1475239) | Altfel de copăcei... Arbori indexaţi binar | Cod sursa (job #590809)
Cod sursa(job #590809)
#include<cstdio>
#define infile "rmq.in"
#define outfile "rmq.out"
#define n_max 1000
#define min(a,b) a<b ? a : b
using namespace std;
void citeste();
void afiseaza();
int a[n_max][n_max];
int n,m,x,y;
void rezolva()
{
for(int i=1;i<=n;i++)
a[i][i]=a[0][i];
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
a[i][j]=min(a[i][j-1],a[0][j]);
}
int main()
{
freopen(infile,"r",stdin);
freopen(outfile,"w",stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
scanf("%d",&a[0][i]);
rezolva();
for(;m;m--)
{
scanf("%d %d",&x,&y);
printf("%d\n",a[x][y]);
}
fclose(stdin);
fclose(stdout);
return 0;
}