夏夜、

摘要： if(n%2==0)s(n)=s(n/2)+s(n/2)*A^(n/2)else s(n)=s((n-1)/2)+s((n-1)/2)*A^((n-1)/2) + A^n。//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long lo 阅读全文

摘要： dp[i][l]表示在结点i再走l步不碰到单词结点的概率。关键一步：val[u]|=val[fail[u]];#include#include#include#include#include#include#includeusing namespace std;const int MAX_NODE=444;const int SIGMA_SIZE=62;struct ACAutomation{ int sz; int fail[MAX_NODE]; int ch[MAX_NODE][SIGMA_SIZE]; int val[MAX_NODE]; double dp... 阅读全文

摘要： 因为有重复，结点用vector保存单词编号。#include#include#include#include#include#include#includeusing namespace std;const int MAX_NODE=15000;const int SIGMA_SIZE=26;struct ACAutomation{ int sz; int ch[MAX_NODE][SIGMA_SIZE]; int fail[MAX_NODE]; vector val[MAX_NODE]; void init() { sz=1; ... 阅读全文

摘要： //#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef pair pii;#define pb(a) push_back(a)#define INF 0x1f1f1f1f#define lson id 阅读全文

摘要： //#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef pair pii;#define pb(a) push_back(a)#define INF 0x1f1f1f1f#define lson id 阅读全文

摘要： 单词会重复，累加完一个的单词后把val清0，避免重复计算。//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef pair pii;#define pb(a) push_back(a)#define 阅读全文

摘要： 找来测代码//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef pair pii;#define pb(a) push_back(a)#define INF 0x1f1f1f1f#define ls 阅读全文

摘要： KMP.暴力strstr也轻松过.//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef pair pii;#define pb(a) push_back(a)#define INF 0x1f1f1f 阅读全文

摘要： 并查集维护：y的最大最小值、城市数量线段树维护：城市数量，洲数量合并两个集合时，先在线段树上删除两个子集合的旧的信息，然后再将合并完的新集合更新到线段树。//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typ 阅读全文

摘要： //#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;typedef pair pii;#define pb(a) push_back(a)#define INF 0x1f1f1f1f#define lson id 阅读全文