POJ 1509(字符串最小表示)

原创 2012年03月29日 08:32:37
Glass Beads
Time Limit: 3000MS   Memory Limit: 10000K
Total Submissions: 1508   Accepted: 875

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. 

裸地字符串最小表示。。。。囧。。。。。第一次接触者玩意,挺神奇的

#include<stdio.h>
#include<string.h>

#define maxn 10001

char s[maxn];
int solve(char *s,  int l) //返回最小表示的起始位置
{
    int i = 0, j = 1, k = 0, t;
    while(i<l && j<l && k<l)
    {
        t = s[(i+k) >= l ? i+k-l : i+k] - s[(j+k) >= l ? j+k-l : j+k];
        if(!t) k++;
        else
        {
            if(t>0) i = i+k+1;
            else j = j+k+1;
            if(i==j) ++j;
            k = 0;
        }
    }
    return (i < j ? i : j);
}

int main()
{
    int n;
    scanf("%d\n",&n);
    while(n--)
    {
        scanf("%s",s);
        printf("%d\n",solve(s,strlen(s))+1);
    }
    return 0;
}



poj 1509 字符串的最小表示法 (SAM 后缀自动机)

http://poj.org/problem?id=1509 题意:就是求一个字符串的最小表示法开头字符的位置,如果有多个,求最小的位置。   思路:这道题用后缀自动机来做本身就是闲着,有点大材...
  • dyx404514
  • dyx404514
  • 2013年03月24日 20:46
  • 6321

字符串最小表示法 O(n)算法

求字符串的循环最小表示:   上面说的两个字符串同构的,并没有直接先求出Min(s),而是通过指针移动,当某次匹配串长时,那个位置就是Min(s)。而这里的问题就是:不是给定两个串,而是给出一个串...
  • zy691357966
  • zy691357966
  • 2014年10月07日 15:58
  • 10793

[土狗之路]Coursera C++第10周作业(上)

这周作业有八道题,所以分为上下两部分。 先来第一题: 编程题#1:求字母的个数 来源: POJ (Coursera声明:在POJ上完成的习题将不会计入Coursera的最后成绩。...
  • panda711
  • panda711
  • 2016年01月19日 19:12
  • 1415

poj1509 字符串最小表示法

Glass Beads Time Limit: 3000MS   Memory Limit: 10000K Total Submissions: 2708   Accepted: 1573...
  • bigsungod
  • bigsungod
  • 2014年11月26日 12:21
  • 632

POJ1509——Glass Beads(字符串的最小表示法)

Glass Beads Time Limit: 3000MS   Memory Limit: 10000K Total Submissions: 3826   Ac...
  • say_c_box
  • say_c_box
  • 2016年07月31日 21:23
  • 186

poj 1509 字符串的最小表示法 (SAM 后缀自动机)

http://poj.org/problem?id=1509 题意:就是求一个字符串的最小表示法开头字符的位置,如果有多个,求最小的位置。   思路:这道题用后缀自动机来做本身就是闲着,有点大材...
  • dyx404514
  • dyx404514
  • 2013年03月24日 20:46
  • 6321

poj1509(最小表示法)

Glass Beads Time Limit: 3000MS   Memory Limit: 10000K Total Submissions: 1976   Accepted: 1150...
  • xj2419174554
  • xj2419174554
  • 2013年08月17日 11:49
  • 790

poj 1509 Glass Beads (最小表示法,模板题)

小记:字符串的最小表示法的最基本的应用,之前还不知道呢, 于是查了查资料看了看,发现这方法其实...
  • ljd4305
  • ljd4305
  • 2014年07月25日 14:43
  • 856

POJ 1509 Glass Beads(最小表示法、后缀自动机)

POJ 1509 Glass Beads(最小表示法、后缀自动机)
  • hhhhhh_12
  • hhhhhh_12
  • 2017年08月05日 14:43
  • 170

poj1509 最小表示法

1.起始问题 :比较两个字符串是否循环同构        比如说abca和caab是循环同构的(abca和acba不是循环同构) 2.复杂度较高的算法       例举A串的所有循环同构串 和B串...
  • qq_21704477
  • qq_21704477
  • 2016年02月14日 15:05
  • 585
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 1509(字符串最小表示)
举报原因:
原因补充:

(最多只允许输入30个字)