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_20179177_12295.cpp: In function 'void calheight(int*, int*, int)':
0_0_20179177_12295.cpp:53:30: error: reference to 'rank' is ambiguous
     for (i = 1; i <= n; i++) rank[sa[i]] = i;
                              ^
0_0_20179177_12295.cpp:9:5: note: candidates are: int rank [330030]
 int rank[N * 3], height[N * 3], s[N], n ,ans;
     ^
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_20179177_12295.cpp:3:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^
0_0_20179177_12295.cpp:54:31: error: reference to 'rank' is ambiguous
     for (i = 0; i < n; height[rank[i++]] = k,ans=max(ans,k))
                               ^
0_0_20179177_12295.cpp:9:5: note: candidates are: int rank [330030]
 int rank[N * 3], height[N * 3], s[N], n ,ans;
     ^
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_20179177_12295.cpp:3:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^
0_0_20179177_12295.cpp:55:34: error: reference to 'rank' is ambiguous
         for (k ? k-- : 0, j = sa[rank[i] - 1]; r[i + k] == r[j + k]; k++);
                                  ^
0_0_20179177_12295.cpp:9:5: note: candidates are: int rank [330030]
 int rank[N * 3], height[N * 3], s[N], n ,ans;
     ^
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_20179177_12295.cpp:3:
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-11-16 11:35:04, Gzip enabled