记录个DFA的模版POJ2778
摘要：
DFA+矩阵乘法#include <iostream>#include <cstdio>#include <cstring>using namespace std;typedef long long llg;const int N = 105;const int P = 100000;struct node{ int flag, index; node *pre, *next[4]; void init() { flag = index = 0; pre = 0; memset(next, 0, sizeof(next)); ... 阅读全文
posted @ 2012-02-26 13:54 Moon_1st 阅读(554) 评论(0) 推荐(0) 编辑
