不慌不忙、不急不躁

题目链接：spoj 375. Query on a tree题目大意： poj 3237的简化版，用同一份代码都能过。解题思路：略。#include #include #include using namespace std;const int maxn = 10005;const int INF = 0x3f3f3f3f;#define lson(x) (

题目链接：spoj 1812 Longest Common Substring II代码#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long ll;const int maxn = 100005;const int SIGMA_SIZE = 26;const

题目链接：spoj 8222 Substrings代码#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long ll;const int maxn = 250005;const int SIGMA_SIZE = 26;struct SAM { int sz

题目链接：spoj 7258 Lexicographical Substring Search代码 - 后缀数组#include <cstdio>#include <cstring>#include <stack>#include <vector>#include <algorithm>using namespace std;const int maxn = 90000 + 5;struc

题目链接：spojm 1811 Longest Common Substring代码#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long ll;const int maxn = 250005;const int SIGMA_SIZE = 26;struct S