不慌不忙、不急不躁

题目链接：hdu 4436 str2int解题思路将所有字符串拼接在一起，连接处用不会出现的字符10代替。然后根据拓扑序，维护每个节点的sum 取模后的和，cnt 以该节点为终止位置的字符串个数。代码#include <cstdio>#include <cstring>#include <queue>#include <algorithm>using namespace std;typede

题目链接：uva 719 - Glass Beads题目大意：给定一个字符串，求最小表示法。解题思路：最小表示法。#include #include #include using namespace std;const int maxn = 1e4+5;char s[maxn];int main () { int cas; scanf("%d

题目链接：hdu 4641 K-string代码#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long ll;const int maxn = 300005;const int SIGMA_SIZE = 26;struct SAM { int sz, l

题目链接：hdu 5343 MZL’s Circle Zhou代码#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef unsigned long long ll;const int maxn = 90005;const int SIGMA_SIZE = 26;struct SA

题目链接：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 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

题目链接：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

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

题目链接：zoj 3891 K-hash代码#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long ll;const int maxn = 50005;const int maxm = 35;const int SIGMA_SIZE = 10;struct S

题目链接：Codeforces 235C Cyclical Quest代码#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long ll;const int maxn = 1e6 + 5;const int SIGMA_SIZE = 26;struct SAM {

题目链接：poj 3415 Common Substrings代码-后缀数组#include <cstdio>#include <cstring>#include <stack>#include <vector>#include <algorithm>using namespace std;typedef long long ll;typedef pair<int,int> pii;c

题目链接：Codeforces 427D Match & Catch代码#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long ll;const int maxn = 1e4 + 5;const int SIGMA_SIZE = 26;const int in

题目链接：hdu 4622 Reincarnation解题思路对字符串的每个后缀串构建一次后缀自动机，后缀自动机中维护一个tot记录当前串有多少个不同子串，处理出二维ans数组。代码#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long ll;const int