La 3942
来源:互联网 发布:查找客户资料的软件 编辑:程序博客网 时间:2024/05/17 06:54
# include<string.h>
# define maxnode 1000000
# define sigma_size 26
# define mod 20071207
int ch[maxnode][sigma_size];
int val[maxnode];
int sz;
int idx(char c)
{
return c-'a';
}
void insert(char *s,int v)
{
int u=0,n=strlen(s);
for(int i=0;i<n;i++)
{
int c=idx(s[i]);
if(!ch[u][c])
{
memset(ch[sz],0,sizeof(ch[sz]));
val[sz]=0;
ch[u][c]=sz++;
}
u=ch[u][c];
}
val[u]=v;
}
char str[300020];
int d[300020],N;
int dp()
{
int j,i=0;
d[0]=1;
str[i]='x';
for(i=0;str[i];i++)
{
int u=0;
for(j=1;j<=N;j++)
{
int c=idx(str[i+j]);
if(ch[u][c])
{
u=ch[u][c];
if(val[u])
d[i+j]=(d[j+i]+d[i])%mod;
}
else break;
}
}
return d[N];
}
int main()
{
int c=0;
while(scanf("%s",str+1)!=EOF)
{
c++;
memset(d,0,sizeof(d));
memset(val,0,sizeof(val));
memset(ch,0,sizeof(ch));
sz=1;
N=strlen(str+1);
int i,j,s;
scanf("%d",&s);
char ss[103];
for(i=0;i<s;i++)
{
scanf("%s",ss);
insert(ss,1);
}
printf("Case %d: %d\n",c,dp());
}
return 0;
}
没不对。。。。。。。一开始 用dP dp(i)=sum(dp(i+j));超时了。。。。。。。应该用递推式!!!!!!!!!!
一下是博主 Wall_F的代码
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
const int maxnode = 4010*100;
const int sigma_size = 26;
const int MAXN = 300010;
const int MOD = 20071027;
char str[MAXN];
int d[MAXN];
struct trie
{
int ch[maxnode][sigma_size];
int val[maxnode];
int sz;
int idx(char c) { return c - 'a';}
void init()
{
sz = 1;
memset(ch[0], 0, sizeof(ch[0]));
}
void insert(char *s, int v)
{
int u = 0, n = strlen(s);
for(int i = 0; i < n; i++)
{
int c = idx(s[i]);
if(!ch[u][c])
{
memset(ch[sz], 0, sizeof(ch[sz]));
val[sz] = 0;
ch[u][c] = sz++;
}
u = ch[u][c];
}
val[u] = v;
}
int find(char *s)
{
int u = 0;
for(int i = 0; s[i]; i++)
{
int c = idx(s[i]);
if(!ch[u][c]) return 0;
u = ch[u][c];
}
return val[u];
}
}Trie;
void read_case()
{
Trie.init();
int n;
scanf("%d", &n);
while(n--)
{
char temp[110];
scanf("%s", temp);
Trie.insert(temp, 1);
}
}
void solve()
{
read_case();
memset(d, 0, sizeof(d));
int len = strlen(str+1);
d[0] = 1, str[0] = 'x';
for(int i = 0; str[i]; i++)
{
int u = 0;
for(int j = 1; j <= len; j++)
{
int c = Trie.idx(str[i+j]);
u = Trie.ch[u][c];
if(!u) break;
else if(Trie.val[u] == 1)
{
d[i+j] += d[i];
if(d[i+j] >= MOD) d[i+j] %= MOD;
}
}
}
printf("%d\n", d[len]);
}
int main()
{
int times = 0;
while(~scanf("%s", str+1))
{
printf("Case %d: ", ++times);
solve();
}
return 0;
}
- LA 3942
- La 3942
- la la la, la la la
- LA 3942 Remember the Word
- LA 3942 - Remember the Word
- LA 3942 - Remember the Word
- (trie树)LA 3942
- la 3942 Rember_前缀树
- LA 3942 Remember the Word
- LA 3942 Remember the Word
- LA-3942 Remember the Word
- LA 3942 Remember the Word
- LA 3942 3942 - Remember the Word
- Remember the word, LA 3942, Trie Tree
- LA 3942 字典树+递推
- UVA 1401 Remember the Word & LA 3942
- LA 3942 Remember the Word(Trie+DP)
- UVALive (LA) - 3942 UVa 1401 Trie
- poj 2201 构造
- JAVA中String.format的用法
- 计算二进制中1的个数
- 关于inline函数
- generic_netlink_howto
- La 3942
- java关于ServletConfig FilterConfig什么用
- Oracle11g和ArcGIS Desktop10.1以CS模式安装
- JSP中读文件和写文件的例子
- linux内核模块编程----ubuntu下我的第一个Hello World驱动
- 26. 不要忽视错误!
- 常见算法-多项式计算(1)
- request.getRemoteAddr()获取的值为0:0:0:0:0:0:0:1?
- 编程珠玑2章B问题--n元一维向量向左旋转i个位置