#include <stdio.h> #include <algorithm> using namespace std; struct node { int data; int order; }array[110000]; bool cmp(struct node a,struct node b) { return a.data<b.data; } int main() { int i,n,q,l,r; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) { scanf("%d",&array[i].data); array[i].order=i+1; } scanf("%d",&q); sort(array,array+n,cmp); while(q--) { scanf("%d%d",&l,&r); for(i=0;i<n;i++) if(array[i].order>=l&&array[i].order<=r) {printf("%d\n",array[i].data);break;} } } return 0; } /* Main.cc: In function ‘int main()’: Main.cc:22:17: error: reference to ‘array’ is ambiguous scanf("%d",&array[i].data); ^ Main.cc:9:3: note: candidates are: node array [110000] }array[110000]; ^ In file included from /usr/include/c++/4.8/tuple:39:0, from /usr/include/c++/4.8/functional:55, from /usr/include/c++/4.8/bits/stl_algo.h:66, from /usr/include/c++/4.8/algorithm:62, from Main.cc:2: /usr/include/c++/4.8/array:81:12: note: template<class _Tp, unsigned int _Nm> struct std::array struct array ^ Main.cc:23:5: error: reference to ‘array’ is ambiguous array[i].order=i+1; ^ Main.cc:9:3: note: candidates are: node array [110000] }array[110000]; ^ In file included from /usr/include/c++/4.8/tuple:39:0, from /usr/include/c++/4.8/functional:55, from /usr/include/c++/4.8/bits/stl_algo.h:66, from /usr/include/c++/4.8/algorithm:62, from Main.cc:2: /usr/include/c++/4.8/array:81:12: note: template<class _Tp, unsigned int _Nm> struct std::array struct array ^ Main.cc:26:9: error: reference to ‘array’ is ambiguous sort(array,array+n,cmp); ^ Main.cc:9:3: note: candidates are: node array [110000] }array[110000]; ^ In file included from /usr/include/c++/4.8/tuple:39:0, from /usr/include/c++/4.8/functional:55, from /usr/include/c++/4.8/bits/stl_algo.h:66, from /usr/include/c++/4.8/algorithm:62, from Main.cc:2: /usr/include/c++/4.8/array:81:12: note: template<class _Tp, unsigned int _Nm> struct std::array struct array ^ Main.cc:26:15: error: reference to ‘array’ is ambiguous sort(array,array+n,cmp); ^ Main.cc:9:3: note: candidates are: node array [110000] }array[110000]; ^ In file included from /usr/include/c++/4.8/tuple:39:0, from /usr/include/c++/4.8/functional:55, from /usr/include/c++/4.8/bits/stl_algo.h:66, from /usr/include/c++/4.8/algorithm:62, from Main.cc:2: /usr/include/c++/4.8/array:81:12: note: template<class _Tp, unsigned int _Nm> struct std::array struct array ^ Main.cc:31:9: error: reference to ‘array’ is ambiguous if(array[i].order>=l&&array[i].order<=r) ^ Main.cc:9:3: note: candidates are: node array [110000] }array[110000]; ^ In file included from /usr/include/c++/4.8/tuple:39:0, from /usr/include/c++/4.8/functional:55, from /usr/include/c++/4.8/bits/stl_algo.h:66, from /usr/include/c++/4.8/algorithm:62, from Main.cc:2: /usr/include/c++/4.8/array:81:12: note: template<class _Tp, unsigned int _Nm> struct std::array struct array ^ Main.cc:31:28: error: reference to ‘array’ is ambiguous if(array[i].order>=l&&array[i].order<=r) ^ Main.cc:9:3: note: candidates are: node array [110000] }array[110000]; ^ In file included from /usr/include/c++/4.8/tuple:39:0, from /usr/include/c++/4.8/functional:55, from /usr/include/c++/4.8/bits/stl_algo.h:66, from /usr/include/c++/4.8/algorithm:62, from Main.cc:2: /usr/include/c++/4.8/array:81:12: note: template<class _Tp, unsigned int _Nm> struct std::array struct array ^ Main.cc:32:21: error: reference to ‘array’ is ambiguous {printf("%d\n",array[i].data);break;} ^ Main.cc:9:3: note: candidates are: node array [110000] }array[110000]; ^ In file included from /usr/include/c++/4.8/tuple:39:0, from /usr/include/c++/4.8/functional:55, from /usr/include/c++/4.8/bits/stl_algo.h:66, from /usr/include/c++/4.8/algorithm:62, from Main.cc:2: /usr/include/c++/4.8/array:81:12: note: template<class _Tp, unsigned int _Nm> struct std::array struct array ^ */ |
Double click to view unformatted code.