HDU 5769-->Substring-->2016 Multi-University Training Contest 4
来源:互联网 发布:中国中药专利数据库 编辑:程序博客网 时间:2024/06/05 04:25
http://acm.hdu.edu.cn/showproblem.php?pid=5769
#include <stdio.h>#include <iostream>#include <algorithm>#include <string.h>#define maxs 700010#define MME(i,j) memset(i,j,sizeof(i))using namespace std;int s[maxs],sa[maxs],ranks[maxs],height[maxs];int wa[maxs],wb[maxs],wd[maxs],wv[maxs],loc[maxs];char input[maxs],specialchar;int cmp(int *r,int a,int b,int k){ return r[a]==r[b]&&r[a+k]==r[b+k];}void get_sa(int *r,int n,int m){ int i,j,p,*x=wa,*y=wb; for(i=0;i<m;i++) wd[i]=0; for(i=0;i<n;i++) wd[x[i]=r[i]]++; for(i=1;i<m;i++) wd[i]+=wd[i-1]; for(i=n-1;i>=0;i--) sa[--wd[x[i]]]=i; for(j=1,p=1;p<n;j*=2,m=p) { for(p=0,i=n-j;i<n;i++) y[p++]=i; for(i=0;i<n;i++) if(sa[i]>=j) y[p++]=sa[i]-j; for(i=0;i<n;i++) wv[i]=x[y[i]]; for(i=0;i<m;i++) wd[i]=0; for(i=0;i<n;i++) wd[wv[i]]++; for(i=1;i<m;i++) wd[i]+=wd[i-1]; for(i=n-1;i>=0;i--) sa[--wd[wv[i]]]=y[i]; for(swap(x,y),p=1,x[sa[0]]=0,i=1;i<n;i++){ x[sa[i]]=cmp(y,sa[i-1],sa[i],j) ? p-1:p++; } } for(int i=0;i<=n;i++) printf("SA[%d] is %d\n",i,sa[i]);}void build_height(int *r,int n){ int i,j,k=0; for(i=1;i<=n;i++) ranks[sa[i]]=i; for(i=0;i<n;height[ranks[i++]]=k) { for(k?k--:0,j=sa[ranks[i]-1];r[i+k]==r[j+k];k++); } for(int i=0;i<=n;i++) printf("H[%d] is %d\n",i,height[i]);}int nxt[maxs];int main(){ int t; scanf("%d",&t); for(int tt=1;tt<=t;tt++) { MME(nxt,0); MME(s,0); cin>>specialchar>>input; int len=strlen(input); for(int i=0;input[i];i++) { s[i]=input[i]-'a'+1; } s[len]=0; get_sa(s,len+1,30); build_height(s,len); int pos=len; for(int i=len-1;i>=0;i--) { if(input[i]==specialchar) pos=i; nxt[i]=pos; } long long ans=0; for(int i=1;i<=len;i++) { ans+=len-max(nxt[sa[i]],sa[i]+height[i]); } printf("Case #%d: %lld\n",tt,ans); } return 0;}
0 0
- HDU 5769-->Substring-->2016 Multi-University Training Contest 4
- 2016 Multi-University Training Contest 4 1006 Substring
- 2016 多校 Multi-University Training Contest 4 Substring
- 2016 Multi-University Training Contest 4 1007 (hdu 5770)
- 2016 Multi-University Training Contest 4
- 2016 Multi-University Training Contest 4
- 2016 Multi-University Training Contest 4 题解
- 2016 Multi-University Training Contest 4 1006 Substring(后缀数组)
- (HDU 5733)2016 Multi-University Training Contest 1 tetrahedron(几何)
- 2016 Multi-University Training Contest 1 1002 hdu 5724 博弈
- 2016 Multi-University Training Contest 1-1004---HDU 5726 GCD
- HDU 5729 Rigid Frameworks (from: 2016 Multi-University Training Contest)
- 2016 Multi-University Training Contest 2 1001 hdu 5734 暴力
- HDU 2016 Multi-University Training Contest 2 1001
- HDU 5738 Eureka (from: 2016 Multi-University Training Contest 2)
- 2016 Multi-University Training Contest 1 C Game(hdu 5725)
- hdu 5734 Acperience 2016 Multi-University Training Contest 2
- 【HDU】5734 Acperience(2016 Multi-University Training Contest 2)
- Quartz cron任务调度时间表达式格式规则
- UDP和TCP(1)
- java 线程通信的两种方法
- 机器学习与统计学
- poj 1088 滑雪DP
- HDU 5769-->Substring-->2016 Multi-University Training Contest 4
- vi编辑器
- 激活Myeclipse后续
- PLSQLDeveloper文本导入器使用步骤
- Java截取字符串
- Linux下查看内存使用情况方法总结
- Yii 1.1操作Cookie
- MemCache详细解读
- 拖动