摘要：
1 /* 2 3 */ 4 5 // include file 6 #include <cstdio> 7 #include <cstdlib> 8 #include <cstring> 9 #include <cmath> 10 #include <cctype> 11 #include <ctime> 12 13 #include <iostream> 14 #include <sstream> 15 #include <fstream> 16 #include <iomani 阅读全文
摘要：
/*无向图，欧拉回路或者通路的判定。*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include <bitset>#includ 阅读全文
摘要：
// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include <bitset>#include <algorithm># 阅读全文
摘要：
/* 字符串处理， 可以用trie,后缀数组,暴力等算法实现 暂时用trie tree实现*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#in 阅读全文
摘要：
/*好做 ，也可以用SPlay,BST,SizeBalancedTree,二叉排序树采用trie tree做的*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <ioma 阅读全文
摘要：
/*欧拉回路或者通路的判定对于有向图：欧拉通路的判定：出了两个顶点外，所有顶点的入度和出度相等。另外的两个顶点的出度比入度大一，入度比出度大1欧拉回路的盘点：所有点的出度和入度相等对于无向图:欧拉通路的判定：连通，只有两个奇度顶点欧拉回路的判定：连通，全是偶度顶点还需要判断是否连通图*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#in 阅读全文