#include<iostream> #include<cstdio> #include<algorithm> using namespace std; bool cmp(struct data a, struct data b); struct data { int value; int seq; }num[100002]; int main() { int n; int q, l, r; while(scanf("%d", &n) != EOF) { for(int i = 0; i < n; i++) { scanf("%d", &num[i].value); num[i].seq = i+1; } sort(num, num+n, cmp); scanf("%d", &q); while(q--) { scanf("%d%d", &l, &r); for(int i = 0; i < n; i++) if(num[i].seq <= r && num[i].seq >= l) { printf("%d\n", num[i].value ); break; } } } return 0; } bool cmp(data a, data b) { return a.value < b.value; } |
Double click to view unformatted code.