URAL 题目1517. Freedom of Choice(后缀数组,求公共最长串)
2015-08-21 18:13
357 查看
1517. Freedom of Choice
Time limit: 2.0 secondMemory limit: 64 MB
Background
Before Albanian people could bear with the freedom of speech (this story is fully described in the problem "Freedomof speech"), another freedom - the freedom of choice - came down on them. In the near future, the inhabitants will have to face the first democratic Presidential election in the history of their country.
Outstanding Albanian politicians liberal Mohammed Tahir-ogly and his old rival conservative Ahmed Kasym-bey declared their intention to compete for the high post.
Problem
According to democratic traditions, both candidates entertain with digging dirt upon each other to the cheers of their voters' approval. When occasion offers, each candidate makes an election speech,which is devoted to blaming his opponent for corruption, disrespect for the elders and terrorism affiliation. As a result the speeches of Mohammed and Ahmed have become nearly the same, and now it does not matter for the voters for whom to vote.
The third candidate, a chairman of Albanian socialist party comrade Ktulhu wants to make use of this situation. He has been lazy to write his own election speech, but noticed, that some fragments of
the speeches of Mr. Tahir-ogly and Mr. Kasym-bey are completely identical. Then Mr. Ktulhu decided to take the longest identical fragment and use it as his election speech.
Input
The first line contains the integer number N (1 ≤ N ≤ 100000). The second line contains the speech of Mr. Tahir-ogly.The third line contains the speech of Mr. Kasym-bey. Each speech consists of N capital latin letters.
Output
You should output the speech of Mr. Ktulhu. If the problem has several solutions, you should output any of them.Sample
input | output |
---|---|
28 VOTEFORTHEGREATALBANIAFORYOU CHOOSETHEGREATALBANIANFUTURE | THEGREATALBANIA |
Problem Source: Timus Top Coders: Third Challenge
ac代码
#include<stdio.h> #include<string.h> #include<algorithm> #include<iostream> #define min(a,b) (a>b?b:a) #define max(a,b) (a>b?a:b) using namespace std; char str[400100]; int sa[400100],Rank[400100],rank2[400100],height[400100],c[400100],*x,*y; int n; void cmp(int n,int sz) { int i; memset(c,0,sizeof(c)); for(i=0;i<n;i++) c[x[y[i]]]++; for(i=1;i<sz;i++) c[i]+=c[i-1]; for(i=n-1;i>=0;i--) sa[--c[x[y[i]]]]=y[i]; } void build_sa(char *s,int n,int sz) { x=Rank,y=rank2; int i,j; for(i=0;i<n;i++) x[i]=s[i],y[i]=i; cmp(n,sz); int len; for(len=1;len<n;len<<=1) { int yid=0; for(i=n-len;i<n;i++) { y[yid++]=i; } for(i=0;i<n;i++) if(sa[i]>=len) y[yid++]=sa[i]-len; cmp(n,sz); swap(x,y); x[sa[0]]=yid=0; for(i=1;i<n;i++) { if(y[sa[i-1]]==y[sa[i]]&&sa[i-1]+len<n&&sa[i]+len<n&&y[sa[i-1]+len]==y[sa[i]+len]) x[sa[i]]=yid; else x[sa[i]]=++yid; } sz=yid+1; if(sz>=n) break; } for(i=0;i<n;i++) Rank[i]=x[i]; } void getHeight(char *s,int n) { int k=0; for(int i=0;i<n;i++) { if(Rank[i]==0) continue; k=max(0,k-1); int j=sa[Rank[i]-1]; while(s[i+k]==s[j+k]) k++; height[Rank[i]]=k; } } int ml,mr; int judge(int len,int k) { int i; for(i=1;i<len;i++) { if(height[i]>=k) { if(sa[i]>n&&sa[i-1]<=n||sa[i-1]>n&&sa[i]<=n) { ml=sa[i]; mr=sa[i]+height[i]; return 1; } } } return 0; } int main() { // int n; while(scanf("%d",&n)!=EOF) { int i,j; scanf("%s",str); str =127; scanf("%s",str+n+1); int len=strlen(str); build_sa(str,len,128); getHeight(str,len); int l=0,r=n; while(l<=r) { int mid=(l+r)>>1; if(judge(len,mid)) { l=mid+1; } else r=mid-1; } for(j=ml;j<mr;j++) { // printf("%d",s[j]); printf("%c",str[j]); } printf("\n"); } }
相关文章推荐
- 课程设计,文件加密
- SAMA5D3的SPI10M速率传输
- codeforces Gym 100338H High Speed Trains (递推,高精度)
- 模态运行EXE程序
- 课程设计,文件加密
- day6: Block、数组高级:Block语法、Block使用、Block实现数组排序
- Android Train--探索----他山之石,可以攻玉
- Java学习笔记·#1·Java环境搭建
- 怎样打包java文件,使之能直接在系统下运行
- WIN7 嵌入式系统安装教程 Windows Embedded Standard 2011 安装
- WIN7 嵌入式系统安装教程 Windows Embedded Standard 2011 安装
- ios7之后的适配属性讲解edgesForExtendedLayout、extendedLayoutIncludesOpaqueBars等
- 堆排序
- WIN7 嵌入式系统安装教程 Windows Embedded Standard 2011 安装
- 应用程序的关闭退出(在FMX中,Activity替代了Form的概念)
- 二叉树的遍历:先序中序后序遍历的递归与非递归实现及层序遍历
- WIN7 嵌入式系统安装教程 Windows Embedded Standard 2011 安装
- C# FTP操作类
- jvm学习笔记
- android权限管理