0_0_16387552_29559.cpp: In function 'void dfs2(int, int)':
0_0_16387552_29559.cpp:55:5: error: reference to 'rank' is ambiguous
rank[tid[u]]=u;
^
0_0_16387552_29559.cpp:15:19: note: candidates are: int rank [50010]
int dep[N],tid[N],rank[N],fa[N];//dep表示树的深度；fa是当前点的父节点;tip显示i节点对应的线段树上的编号；rank是线段树上对应编号对应的点
^
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++/bits/stl_algobase.h:64,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/char_traits.h:39,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ostream:38,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/iostream:39,
from 0_0_16387552_29559.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_16387552_29559.cpp: In function 'void Build(int, int, int)':
0_0_16387552_29559.cpp:94:21: error: reference to 'rank' is ambiguous
sum[rt]=num[rank[l]];
^
0_0_16387552_29559.cpp:15:19: note: candidates are: int rank [50010]
int dep[N],tid[N],rank[N],fa[N];//dep表示树的深度；fa是当前点的父节点;tip显示i节点对应的线段树上的编号；rank是线段树上对应编号对应的点
^
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++/bits/stl_algobase.h:64,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/char_traits.h:39,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ostream:38,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/iostream:39,
from 0_0_16387552_29559.cpp:2:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note: template<class> struct std::rank
struct rank
^
|
