poj1509:Glass Beads(后缀自动机)
来源:互联网 发布:js怎么判断对象为空 编辑:程序博客网 时间:2024/06/05 15:22
Description
Once upon a time there was a famous actress. As you may expect, she played mostly Antique Comedies most of all. All the people loved her. But she was not interested in the crowds. Her big hobby were beads of any kind. Many bead makers were working for her and they manufactured new necklaces and bracelets every day. One day she called her main Inspector of Bead Makers (IBM) and told him she wanted a very long and special necklace.
The necklace should be made of glass beads of different sizes connected to each other but without any thread running through the beads, so that means the beads can be disconnected at any point. The actress chose the succession of beads she wants to have and the IBM promised to make the necklace. But then he realized a problem. The joint between two neighbouring beads is not very robust so it is possible that the necklace will get torn by its own weight. The situation becomes even worse when the necklace is disjoined. Moreover, the point of disconnection is very important. If there are small beads at the beginning, the possibility of tearing is much higher than if there were large beads. IBM wants to test the robustness of a necklace so he needs a program that will be able to determine the worst possible point of disjoining the beads.
The description of the necklace is a string A = a1a2 … am specifying sizes of the particular beads, where the last character am is considered to precede character a1 in circular fashion.
The disjoint point i is said to be worse than the disjoint point j if and only if the string aiai+1 … ana1 … ai-1 is lexicografically smaller than the string ajaj+1 … ana1 … aj-1. String a1a2 … an is lexicografically smaller than the string b1b2 … bn if and only if there exists an integer i, i <= n, so that aj=bj, for each j, 1 <= j < i and ai < bi
Input
The input consists of N cases. The first line of the input contains only positive integer N. Then follow the cases. Each case consists of exactly one line containing necklace description. Maximal length of each description is 10000 characters. Each bead is represented by a lower-case character of the english alphabet (a–z), where a < b … z.
Output
For each case, print exactly one line containing only one integer – number of the bead which is the first at the worst possible disjoining, i.e.\ such i, that the string A[i] is lexicographically smallest among all the n possible disjoinings of a necklace. If there are more than one solution, print the one with the lowest i.
Sample Input
4
helloworld
amandamanda
dontcallmebfu
aaabaaa
Sample Output
10
11
6
题目大意:
给你一个字符串,可将字符串前面字符串移到最后,求移动后字典序最小的字符串。
题解:后缀自动机。
先将原字符串复制一遍至串尾,之后建立后缀自动机,对后缀自动机由小到大深搜直到找到深度为len的节点,输出节点的位置pos-len+1。
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<algorithm>#include<cmath>#include<cstdlib>using namespace std;const int Maxn=5e4+50;char ch[Maxn];int le,n;struct sam{ int last,p,q,np,nq,l[Maxn],par[Maxn],to[Maxn][27],pos[Maxn],sum; sam() { last=++sum; } inline void extend(int c,int now) { p=last,np=last=++sum; pos[np]=now; l[np]=l[p]+1; for(;!to[p][c];p=par[p])to[p][c]=np; if(!p)par[np]=1; else { int q=to[p][c]; if(l[q]==l[p]+1)par[np]=q; else { nq=++sum;l[nq]=l[p]+1; memcpy(to[nq],to[q],sizeof(to[nq])); par[nq]=par[q];par[q]=par[np]=nq; for(;to[p][c]==q;p=par[p])to[p][c]=nq; } } } inline void build() { int len=strlen(ch+1); for(int i=1;i<=len;i++) extend(ch[i]-'a'+1,i); } inline void reset() { last=sum=1; memset(l,0,sizeof(l)); memset(par,0,sizeof(par)); memset(to,0,sizeof(to)); } inline int find() { int po=1; for(int tt=1;tt<=le;tt++) { for(int i=1;i<=26;i++) { if(to[po][i]) { po=to[po][i]; break; } } } return pos[po]; }}sam;int main(){ scanf("%d",&n); while(n--) { memset(ch,0,sizeof(ch)); scanf("%s",ch+1); le=strlen(ch+1); memcpy(ch+le+1,ch+1,sizeof(char)*le); sam.reset(); sam.build(); printf("%d\n",sam.find()-le+1); }}
- poj1509:Glass Beads(后缀自动机)
- poj1509 Glass Beads,后缀自动机
- [POJ1509]Glass Beads && 后缀自动机
- poj1509 Glass Beads 后缀数组
- POJ1509--Glass Beads
- poj1509 Glass Beads SAM
- poj1509 Glass Beads sam
- [SAM] POJ1509 Glass Beads
- POJ 1509 Glass Beads(最小表示法、后缀自动机)
- uva 719 - Glass Beads(后缀自动机)
- POJ 1509 Glass Beads 后缀自动机
- uva 719 Glass Beads (后缀自动机)
- 【POJ】1509 Glass Beads 【后缀自动机】
- POJ 1509 Glass Beads 后缀自动机
- POJ1509:Glass Beads(循环同构最小表示)
- POJ 1509 Glass Beads 后缀自动机 或 后缀数组
- 【POJ1509】Glass Beads 最小表示法
- POJ 1509 Glass Beads【后缀自动机、最小表示法】
- 各种内部排序算法的比较和应用
- Notification
- 漫步数理统计二十八——混合分布
- Javascript中canvas绘制五子棋棋盘
- HDU5493-Queue
- poj1509:Glass Beads(后缀自动机)
- 2016搜索提高1017
- SQL中常用模糊查询的四种匹配模式&&正则匹配
- python中的range和xrange的使用和区别
- Spring4 之IOC详解xml配置
- 论如何获取洛谷所有用户的ID
- 详解Javascript 函数声明和函数表达式的区别
- 随便写写
- 从零学习安装虚拟机及选择系统