F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_18052273_30638.cpp: In function 'int main()':
0_0_18052273_30638.cpp:108:10: error: reference to 'rank' is ambiguous
          rank[seg[i].id]=i;
          ^
0_0_18052273_30638.cpp:9:40: note: candidates are: int rank [100005]
 int c1[M],lson[M],rson[M],tot,n,T[N*2],rank[N];
                                        ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/move.h:57:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_pair.h:59,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/utility:70,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:60,
                 from 0_0_18052273_30638.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^
0_0_18052273_30638.cpp:114:31: error: reference to 'rank' is ambiguous
            T[i]=insert(T[i-1],rank[node[i].id],1,node[i].h);
                               ^
0_0_18052273_30638.cpp:9:40: note: candidates are: int rank [100005]
 int c1[M],lson[M],rson[M],tot,n,T[N*2],rank[N];
                                        ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/move.h:57:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_pair.h:59,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/utility:70,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:60,
                 from 0_0_18052273_30638.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^
0_0_18052273_30638.cpp:116:31: error: reference to 'rank' is ambiguous
            T[i]=insert(T[i-1],rank[node[i].id],-1,node[i].h);
                               ^
0_0_18052273_30638.cpp:9:40: note: candidates are: int rank [100005]
 int c1[M],lson[M],rson[M],tot,n,T[N*2],rank[N];
                                        ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/move.h:57:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_pair.h:59,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/utility:70,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:60,
                 from 0_0_18052273_30638.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-09-28 07:15:59, Gzip enabled