View Code of Problem 134

#include<stdio.h>

int main(){
	//有多组数据。 
	//每组数据,第一行为一个n,1<=n<=100000,第二行有n个整数,表示一个序列,第三行为一个数字q,1<=q<=100000, 
	//接下来q行,每行有两个数字l、r,1<=l <=r<=n。 

	long n,i,q,l,r,j,min;
	scanf("%d",&n);
	long a[100000];
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	scanf("%d",&q);
	for(i=0;i<q;i++){
		scanf("%d %d",&l,&r);
		min = a[l-1];
		for(j=l;j<r;j++){
			if(min>a[j])
				min = a[j];
		}
		printf("%d\n",min);
	}
	
	return 0;
} 

Double click to view unformatted code.


Back to problem 134