spoj1812 Longest Common Substring II(LCS2)多个字符串
来源:互联网 发布:玉伯 数组去重 编辑:程序博客网 时间:2024/05/20 03:06
1811LCS的升级版。
求十个串的最长连续公共子串。
第一个串建立自动机。
用其它每个串在自动机上跑一遍,记录每个状态上能匹配的最长长度。
然后求每个状态匹配长度的最小值。
注意每个状态能匹配的,每个状态的父节点也能匹配。
利用拓扑排序(按照len),从深到浅依次更新父亲的匹配长度。
由于spoj实在是太搓,这一步要用基数排序,或者是O(n)的拓扑排序来实现。
很坑的是各种数组记得开成两倍长。后缀自动机总节点数最多是长度两倍。
Input:alsdfkjfjkdsalfdjskalajfkdslaaaaajfaaaaOutput:2
//china no.1#pragma comment(linker, "/STACK:1024000000,1024000000")#include <vector>#include <iostream>#include <string>#include <map>#include <stack>#include <cstring>#include <queue>#include <list>#include <stdio.h>#include <set>#include <algorithm>#include <cstdlib>#include <cmath>#include <iomanip>#include <cctype>#include <sstream>#include <functional>#include <stdlib.h>#include <time.h>#include <bitset>using namespace std;#define pi acos(-1)#define s_1(x) scanf("%d",&x)#define s_2(x,y) scanf("%d%d",&x,&y)#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)#define PI acos(-1)#define endl '\n'#define srand() srand(time(0));#define me(x,y) memset(x,y,sizeof(x));#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)#define close() ios::sync_with_stdio(0); cin.tie(0);#define FOR(x,n,i) for(int i=x;i<=n;i++)#define FOr(x,n,i) for(int i=x;i<n;i++)#define fOR(n,x,i) for(int i=n;i>=x;i--)#define fOr(n,x,i) for(int i=n;i>x;i--)#define W while#define sgn(x) ((x) < 0 ? -1 : (x) > 0)#define bug printf("***********\n");#define db double#define ll long long#define mp make_pair#define pb push_backtypedef pair<long long int,long long int> ii;typedef long long LL;const int INF=0x3f3f3f3f;const LL LINF=0x3f3f3f3f3f3f3f3fLL;const int dx[]={-1,0,1,0,1,-1,-1,1};const int dy[]={0,1,0,-1,-1,1,-1,1};const int maxn=110000;const int maxx=600005;const double EPS=1e-8;const double eps=1e-8;const int mod=1e9+7;template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}template <class T>inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}if(IsN) num=-num;return true;}void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}void print(LL a){ Out(a),puts("");}//freopen( "in.txt" , "r" , stdin );//freopen( "data.txt" , "w" , stdout );//cerr << "run time is " << clock() << endl;int root,last;int tots; //总结点int l; //字符串长度struct sam_node{ int fa,son[26]; int len; void init(int _len) { len = _len; fa = -1; memset(son,-1,sizeof(son)); }}t[maxn*2];void sam_init(){ tots = 0; root = last = 0; t[tots].init(0);}void extend(int w){ int p=last; int np=++tots;t[tots].init(t[p].len+1); int q,nq; while(p!=-1&&t[p].son[w]==-1){t[p].son[w]=np;p=t[p].fa;} if (p==-1) t[np].fa=root; else { q=t[p].son[w]; if (t[p].len+1==t[q].len){t[np].fa=q;} else { nq=++tots;t[nq].init(0); t[nq]=t[q]; t[nq].len=t[p].len+1; t[q].fa=nq;t[np].fa=nq; while(p!=-1&&t[p].son[w]==q){t[p].son[w]=nq;p=t[p].fa;} } } last=np;}int w[maxn], r[maxn*2];void topsort(){ for(int i = 0; i <= l; ++i) w[i] = 0; for(int i = 1; i <= tots; ++i) w[t[i].len]++; for(int i = 1; i <= l; ++i) w[i] += w[i-1]; for(int i = tots; i >= 1; --i) r[w[t[i].len]--] = i; r[0] = 0;}//int dp[maxn*2];char s[maxn];char f[11][maxn];int ma[11][maxn*2];void work(int num){ int i,now=root,ind,tl=0; int ret=0; for(i=0;i<l;++i) { ind=f[num][i]-'a'; while(now!=-1&&t[now].son[ind]==-1) { now=t[now].fa; if (now!=-1) tl=t[now].len; } if (now==-1) {now=root;tl=0;} else { now=t[now].son[ind]; tl++; //ret=max(ret,tl); ma[num][now]=ma[num][now]<tl?tl:ma[num][now]; } }}int n,ans;int main(){ // freopen("in.txt","r",stdin); scanf("%s",s); n=0; W(scanf("%s",f[n+1])!=EOF) {n++;} sam_init(); l=strlen(s); FOr(0,l,i) extend(s[i]-'a'); me(ma,0); FOR(1,n,i) work(i); topsort(); for(int i=tots;i>=1;i--) { int u=r[i]; if(t[u].fa!=-1) for(int j=1;j<=n;j++) ma[j][t[u].fa]=min(t[t[u].fa].len,max( ma[j][t[u].fa],ma[j][u])); } ans=0; FOR(1,tots,i) { int tma=t[i].len; FOR(1,n,j) { if(ma[j][i]<tma) tma=ma[j][i]; } if(tma>ans) ans=tma; } print(ans);}
阅读全文
0 0
- spoj1812 Longest Common Substring II(LCS2)多个字符串
- [SPOJ1812]LCS2 - Longest Common Substring II
- spoj1812 Longest Common Substring II(LCS2),后缀自动机
- [SPOJ1812]LCS2 - Longest Common Substring II(后缀自动机)
- BZOJ2946 SPOJ1812:Longest Common Substring II(后缀自动机)
- 【spoj1812】Longest Common Substring II 【SAM】
- [spoj1812]Longest Common Substring II && 后缀自动机
- 【spoj1812】Longest Common Substring II 后缀自动机
- SPOJ1812 Longest Common Substring II 后缀自动机
- SPOJ 1812 LCS2 - Longest Common Substring II (后缀自动机)
- SPOJ LCS2 1812. Longest Common Substring II
- SPOJ LCS2 Longest Common Substring II
- SPOJ LCS2 Longest Common Substring II
- SPOJ LCS2 Longest Common Substring II
- SPOJ LCS2 Longest Common Substring II
- SPOJ1812:Longest Common Substring(后缀自动机)
- SPOJ LCS2 Longest Common Substring II 后缀自动机
- 【后缀自动机】[SPOJ LCS2]Longest Common Substring II
- apache 支持.htaccess 解决Internal Server Error The server 错误
- nginx安装配置、Nginx支持php
- javascript 链表(lineked lists)算法与说明
- python正则表达式
- java生成条形码
- spoj1812 Longest Common Substring II(LCS2)多个字符串
- RYU 启动出现unsupported version 0x1. If possible, set the switch to use one of the versions[4]
- Action委托类型
- 关于剑指offer上“从1到n整数中1出现的次数”题的理解
- 图片Base64编码和解码
- du,touch,cp,mv,rm,file,alias,echo,$
- 大数据预科班8
- Html5 canvas
- eclipse安装Hibernate