poj 2004

最新推荐文章于 2017-08-28 14:34:03 发布

Pira

最新推荐文章于 2017-08-28 14:34:03 发布

阅读量828

点赞数

分类专栏： ALL ABOUT ACM 文章标签： struct extension c insert each input

本文链接：https://blog.csdn.net/fp_hzq/article/details/6336840

版权

ALL ABOUT ACM 专栏收录该内容

40 篇文章 0 订阅

订阅专栏

Mix and Build

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 3282		Accepted: 974
Case Time Limit: 2000MS		Special Judge

Description

In this problem, you are given a list of words (sequence of lower case letters). From this list, find the longest chain of words w1, ..., wn such that wi is a mixed extension of w _i-1. A word A is a mixed extension of another word B if A can be formed by adding one letter to B and permuting the result. For example, "ab", "bar", "crab", "cobra", and "carbon" form a chain of length 5.

Input

The input contains at least two, but no more than 10000 lines. Each line contains a word. The length of each word is at least 1 and no more than 20. All words in the input are distinct.

Output

Write the longest chain that can be constructed from the given words. Output each word in the chain on a separate line, starting from the first one. If there are multiple longest chains, any longest chain is acceptable.

Sample Input

ab
arc
arco
bar
bran
carbon
carbons
cobra
crab
crayon
narc

Sample Output

ab
bar
crab
cobra
carbon
carbons

Source

Rocky Mountain 2004

分析：这题有多种解法，暴力貌似都行，囧~~~先把每个单词自身按字母顺序重新拼写，即bca-->abc,然后按单词长度排序，相同长度

按字典顺序排，之后很轻易想到DP，枚举每个单词i为结尾有，查找可以和它连接的单词j，

f[i]=max(f[i],f[j]+1){条件：i可以由j得到}

此处的查找可以多方法，hash还是蛮快的，二分也还好。。。话说一开始好像重构但是错了，郁闷了一天~~~

代码1（二分查找）：

#include<cstdio> #include<cstring> const int maxn=10001; const int maxlen=21; struct dat { char *p,len; int d; }g[maxn]; struct pp { int l,r; }h[maxlen]; struct answer { int len,p; }f[maxn]; char word[maxn][maxlen],w[maxn][maxlen],ne[maxlen],t[26]={0},c; void qqsort(int l,int r) { int i=l,j=r; char *m=g[(l+r)>>1].p,mm=g[(l+r)>>1].len; do { while(g[i].len<mm||(g[i].len==mm&&strcmp(g[i].p,m)<0))++i; while(g[j].len>mm||(g[j].len==mm&&strcmp(g[j].p,m)>0))--j; if(i<=j) { g[0]=g[i],g[i]=g[j],g[j]=g[0]; ++i,--j; } }while(i<=j); if(i<r)qqsort(i,r); if(l<j)qqsort(l,j); } inline int find(int l,int r) { int m,ok; while(l<=r) { m=(l+r)>>1; if(!(ok=strcmp(g[m].p,ne)))return m; ok<0?l=m+1:r=m-1; } return 0; } void out(int x) { if(f[x].len==0)return; out(f[x].p); for(int i=0;i<g[x].len;++i)putchar(word[g[x].d][i]); putchar('/n'); } int main(int argc, char* argv[]) { int i,j,k,n=0,max,ans,gg; while((c=getchar())!=EOF) if(c>='a'&&c<='z') { ++t[(word[++n][i=0]=c)-'a']; while((c=getchar())!=EOF&&c!='/n')++t[(word[n][++i]=c)-'a']; word[n][++i]='/0'; for(i=j=0;i<26;++i) while(t[i]>0)w[n][j++]=i+'a',--t[i]; w[n][j]='/0'; g[n].p=w[n];g[n].d=n,g[n].len=j; } qqsort(1,n); for(i=0;i<maxlen;++i)h[i].l=n+1,h[i].r=0; for(i=1;i<=n;++i) if(h[g[i].len].l>n)h[g[i].len].l=i; for(i=n;i>0;--i) if(h[g[i].len].r<1)h[g[i].len].r=i; for(gg=j=0,i=maxlen;i>=0;--i) if(h[i].r)++j; else { if(j>gg)gg=j; j=0; } for(max=f[0].len=0,i=1;i<=n;++i) { f[i].len=1,f[i].p=0; for(j=1;j<=g[i].len;++j)ne[j-1]=w[g[i].d][j]; for(j=0;j<g[i].len;++j) { if((k=find(h[g[i].len-1].l,h[g[i].len-1].r))&&f[i].len<f[k].len+1) f[i].len=f[k].len+1,f[i].p=k; ne[j]=w[g[i].d][j]; } if(max<f[i].len) { max=f[i].len; ans=i; if(max==gg)break; } } out(ans); return 0; }

代码2（字符串hash，现学现用，哈哈）：

#include<cstdio> #include<cstring> const int maxn=10001; const int maxlen=21; const int M=1000007; const int seed=131; struct dat { char *p,len; int d; }g[maxn]; struct answer { int len,p; }f[maxn]; int id[M]={0}; char word[maxn][maxlen],w[maxn][maxlen],ne[maxlen],t[26]={0},c; void qqsort(int l,int r) { int i=l,j=r; char *m=g[(l+r)>>1].p,mm=g[(l+r)>>1].len; do { while(g[i].len<mm||(g[i].len==mm&&strcmp(g[i].p,m)<0))++i; while(g[j].len>mm||(g[j].len==mm&&strcmp(g[j].p,m)>0))--j; if(i<=j) { g[0]=g[i],g[i]=g[j],g[j]=g[0]; ++i,--j; } }while(i<=j); if(i<r)qqsort(i,r); if(l<j)qqsort(l,j); } inline int BKDRHash(char *str) { int hash=0; while(*str) hash=hash*seed+(*str++); return((hash&0x7FFFFFFF)%M); } inline void insert(char *c,int i) { int x=BKDRHash(c); while(id[x]) { x+=7; if(x>=M)x%=M; } id[x]=i; } inline int find(char *c) { int x=BKDRHash(c); while(id[x]&&strcmp(c,g[id[x]].p)) { x+=7; if(x>=M)x%=M; } return id[x]; } void out(int x) { if(f[x].p)out(f[x].p); for(int i=0;i<g[x].len;++i)putchar(word[g[x].d][i]); putchar('/n'); } int main(int argc, char* argv[]) { int i,j,k,n=0,max,ans,gg; bool h[maxlen]={0}; while((c=getchar())!=EOF) if(c>='a'&&c<='z') { ++t[(word[++n][i=0]=c)-'a']; while((c=getchar())!=EOF&&c!='/n')++t[(word[n][++i]=c)-'a']; word[n][++i]='/0'; for(i=j=0;i<26;++i) while(t[i]>0)w[n][j++]=i+'a',--t[i]; w[n][j]='/0'; g[n].p=w[n],g[n].len=j,g[n].d=n,h[j]=1; } qqsort(1,n); for(i=1;i<=n;++i)insert(g[i].p,i); for(gg=j=0,i=maxlen;i>=0;--i) if(h[i])++j; else { if(j>gg)gg=j; j=0; } char *c; for(max=f[0].len=0,i=1;i<=n;++i) { f[i].len=1,f[i].p=0; for(c=g[i].p+1,j=0;*c!='/0';++c,++j)ne[j]=*c; ne[j]='/0'; for(c=g[i].p,j=0;*c!='/0';++c,++j) { if((k=find(ne))&&f[i].len<f[k].len+1) f[i].len=f[k].len+1,f[i].p=k; ne[j]=*c; } if(max<f[i].len) { max=f[i].len; ans=i; if(max==gg)break; } } out(ans); return 0; }