zoukankan      html  css  js  c++  java
  • SP1812 LCS2

    • 能匹配上子串的节点对它的所有parent都有贡献
    • 在树上转移即可
    #include<cstdio>
    #include<algorithm>
    #include<cstring>
    #include<iostream>
    #include<queue>
    #define ll long long 
    #define M 200010
    using namespace std;
    
    int read()
    {
    	int nm = 0, f = 1;
    	char c = getchar();
    	for(; !isdigit(c); c = getchar()) if(c == '-') f = -1;
    	for(; isdigit(c); c = getchar()) nm = nm * 10 + c - '0';
    	return nm * f;
    }
    
    int ch[M][26], len[M], fa[M], tim[M], a[M], cnt = 1, lst = 1, dp[M], ans[M];
    char s[M];
    
    void insert(int c)
    {
    	int p = ++cnt, f = lst;
    	lst = p;
    	len[p] = len[f] + 1;
    	while(f && !ch[f][c]) ch[f][c] = p, f = fa[f];
    	if(!f) fa[p] = 1;
    	else
    	{
    		int q = ch[f][c];
    		if(len[q] == len[f] + 1) fa[p] = q;
    		else
    		{
    			int nq = ++cnt;
    			fa[nq] = fa[q];
    			memcpy(ch[nq], ch[q], sizeof(ch[nq]));
    			len[nq] = len[f] + 1;
    			fa[q] = fa[p] = nq;
    			while(f && ch[f][c] == q) ch[f][c] = nq, f = fa[f];
    		}
    	}
    }
    
    int main()
    {
    	scanf("%s", s + 1);
    	int l = strlen(s + 1);
    	for(int i = 1; i <= l; i++) insert(s[i] - 'a');
    	for(int i = 1; i <= cnt; i++) tim[len[i]]++;
    	for(int i = 1; i <= cnt; i++) tim[i] += tim[i - 1];
    	for(int i = 1; i <= cnt; i++) a[tim[len[i]]--] = i;
    	for(int i = 1; i <= cnt; i++) ans[i] = len[i];
    	while(scanf("%s", s + 1) != EOF)
    	{
    		memset(dp, 0, sizeof(dp));
    		l = strlen(s + 1);
    		int now = 1, tt = 0;
    		for(int i = 1; i <= l; i++)
    		{
    			int c = s[i] - 'a';
    			if(ch[now][c])
    			{
    				tt++, now = ch[now][c];
    			}
    			else
    			{
    				while(now && !ch[now][c]) now = fa[now];
    				if(!now) now = 1, tt = 0;
    				else tt = len[now] + 1, now = ch[now][c];
    			}
    			dp[now] = max(dp[now], tt);
    		}
    		for(int i = cnt; i >= 0; i--) dp[fa[i]] = max(dp[fa[i]], dp[i]);
    		for(int i = 1; i <= cnt; i++) ans[i] = min(ans[i], dp[i]);
    	}
    	for(int i = 1; i <= cnt; i++) ans[i] = max(ans[i], ans[i - 1]);
    	cout << ans[cnt] << "
    "; 
    	return 0;
    }
    
  • 相关阅读:
    安装完QQ必须要删除掉的几个恐怖文件
    dede实战系统:更换成kindEditor编辑器
    PHP 5.4 中经 htmlspecialchars 转义后的中文字符串为空的问题
    DEDECMS图片集上传图片出错302的解决办法
    dedecms安装完成后登录后台出现空白
    OFV.msi是什么 为什么更新时无法安装
    CentOS 挂载NTFS分区的两种方法
    centos使用yum安装gcc
    NetBeans菜单栏字体太小了
    注入漏洞页
  • 原文地址:https://www.cnblogs.com/luoyibujue/p/10606097.html
Copyright © 2011-2022 走看看