Cod sursa(job #1833901)
Utilizator | Data | 23 decembrie 2016 14:46:23 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <stdio.h>
long int a[100000];
long int n,i,j,k,m;
long int x,y;
int main()
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
scanf("%ld %ld",&n,&m);
for (i=1;i<=n;i++)
scanf("%ld ",&a[i]);
for (i=1;i<=m;i++)
{
scanf("%ld %ld",&x,&y);
k=1000000;
for (j=x;j<=y;j++)
if (a[j]<k) k=a[j];
printf("%ld\n",k);
}
return 0;
}