View Code of Problem 134

#include<iostream>
#include<algorithm>
using namespace std;

struct Num{
	int value;
	int id;
};

bool cmp(Num a,Num b){
	return a.value<b.value;
}

int main(){
	int n;
	while(scanf("%d",&n)!=EOF){
		Num num[n+1];
		for(int i=1;i<=n;++i){
			scanf("%d",&num[i].value);
			num[i].id=i;
		}
		sort(num+1,num+n+1,cmp);
		int q;
		scanf("%d",&q);
		for(int i=0;i<q;++i){
			int l;
			int r;
			scanf("%d %d",&l,&r);
			for(int j=1;j<=n;++j){
				if(num[j].id>=l && num[j].id<=r){
					printf("%d\n",num[j].value);
					break;
				}
			}
		}
	}
	
	return 0;
}

Double click to view unformatted code.


Back to problem 134