#include<iostream> #include<math.h> #include<stdio.h> #include<algorithm> using namespace std; typedef struct{ int data; int index; }arr; bool cmp(arr a,arr b){ return a.data<b.data; } int main() { int n; while(scanf("%d",&n)!=EOF){ arr a[n+1]={0}; for(int i=1;i<=n;i++){ cin>>a[i].data; a[i].index=i; } sort(a+1,a+n+1,cmp); int x; cin>>x; for(int i=0;i<x;i++){ int t1,t2; cin>>t1>>t2; for(int i=1;i<=n;i++){ if(a[i].index>=t1&&a[i].index<=t2){ printf("%d\n",a[i].data); break; } } } } return 0; } |
Double click to view unformatted code.