0_0_35853770_14060.cpp: In function 'void Upfather(int, int, int)':
0_0_35853770_14060.cpp:31:21: error: reference to 'hash' is ambiguous
if(mark[n]) sum[n]=hash[right+1]-hash[left];//表示该区间整个线段长度可以作为底边
^
0_0_35853770_14060.cpp:16:8: note: candidates are: double hash [210]
double hash[MAX];//对x进行离散化,否则x为浮点数且很大无法进行线段树
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/basic_string.h:3068:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:52,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/locale_classes.h:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/ios_base.h:41,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:42,
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_35853770_14060.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
0_0_35853770_14060.cpp:31:35: error: reference to 'hash' is ambiguous
if(mark[n]) sum[n]=hash[right+1]-hash[left];//表示该区间整个线段长度可以作为底边
^
0_0_35853770_14060.cpp:16:8: note: candidates are: double hash [210]
double hash[MAX];//对x进行离散化,否则x为浮点数且很大无法进行线段树
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/basic_string.h:3068:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:52,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/locale_classes.h:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/ios_base.h:41,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:42,
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_35853770_14060.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
0_0_35853770_14060.cpp: In function 'int main()':
0_0_35853770_14060.cpp:66:4: error: reference to 'hash' is ambiguous
hash[k]=x1;
^
0_0_35853770_14060.cpp:16:8: note: candidates are: double hash [210]
double hash[MAX];//对x进行离散化,否则x为浮点数且很大无法进行线段树
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/basic_string.h:3068:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:52,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/locale_classes.h:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/ios_base.h:41,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:42,
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_35853770_14060.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
0_0_35853770_14060.cpp:68:4: error: reference to 'hash' is ambiguous
hash[k]=x2;
^
0_0_35853770_14060.cpp:16:8: note: candidates are: double hash [210]
double hash[MAX];//对x进行离散化,否则x为浮点数且很大无法进行线段树
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/basic_string.h:3068:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:52,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/locale_classes.h:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/ios_base.h:41,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:42,
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_35853770_14060.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
0_0_35853770_14060.cpp:71:8: error: reference to 'hash' is ambiguous
sort(hash,hash+k);//分别对x和扫描线高度排序
^
0_0_35853770_14060.cpp:16:8: note: candidates are: double hash [210]
double hash[MAX];//对x进行离散化,否则x为浮点数且很大无法进行线段树
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/basic_string.h:3068:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:52,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/locale_classes.h:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/ios_base.h:41,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:42,
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_35853770_14060.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
0_0_35853770_14060.cpp:71:13: error: reference to 'hash' is ambiguous
sort(hash,hash+k);//分别对x和扫描线高度排序
^
0_0_35853770_14060.cpp:16:8: note: candidates are: double hash [210]
double hash[MAX];//对x进行离散化,否则x为浮点数且很大无法进行线段树
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/basic_string.h:3068:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:52,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/locale_classes.h:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/ios_base.h:41,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:42,
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_35853770_14060.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
0_0_35853770_14060.cpp:75:10: error: reference to 'hash' is ambiguous
if(hash[i] != hash[i-1]) hash[m++]=hash[i];
^
0_0_35853770_14060.cpp:16:8: note: candidates are: double hash [210]
double hash[MAX];//对x进行离散化,否则x为浮点数且很大无法进行线段树
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/basic_string.h:3068:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:52,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/locale_classes.h:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/ios_base.h:41,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:42,
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_35853770_14060.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
0_0_35853770_14060.cpp:75:21: error: reference to 'hash' is ambiguous
if(hash[i] != hash[i-1]) hash[m++]=hash[i];
^
0_0_35853770_14060.cpp:16:8: note: candidates are: double hash [210]
double hash[MAX];//对x进行离散化,否则x为浮点数且很大无法进行线段树
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/basic_string.h:3068:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:52,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/locale_classes.h:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/ios_base.h:41,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:42,
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_35853770_14060.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
0_0_35853770_14060.cpp:75:32: error: reference to 'hash' is ambiguous
if(hash[i] != hash[i-1]) hash[m++]=hash[i];
^
0_0_35853770_14060.cpp:16:8: note: candidates are: double hash [210]
double hash[MAX];//对x进行离散化,否则x为浮点数且很大无法进行线段树
^
I
|
