【POJ】1509 Glass Beads 【后缀自动机】

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u013368721/article/details/45171667

传送门:【POJ】1509 Glass Beads


my code:

#include <stdio.h>
#include <string.h>
#include <set>
#include <algorithm>
using namespace std ;

typedef long long LL ;
typedef unsigned long long ULL ;
typedef pair < int , int > pii ;

#define rep( i , a , b ) for ( int i = ( a ) ; i <  ( b ) ; ++ i )
#define For( i , a , b ) for ( int i = ( a ) ; i <= ( b ) ; ++ i )
#define rev( i , a , b ) for ( int i = ( a ) ; i >= ( b ) ; -- i )
#define clr( a , x ) memset ( a , x , sizeof a )

const int MAXN = 40005 ;
const int W = 26 ;

struct Node {
	Node* next[W] ;
	Node* fail ;
	int len ;
	int l ;
	void newnode () {
		clr ( next , 0 ) ;
		fail = NULL ;
		len = l = 0 ;
	}
} ;

typedef Node* P_Node ;

struct SAM {
	Node node[MAXN] ;
	P_Node last , root ;
	int cnt ;

	void init () {
		cnt = 0 ;
		node->newnode () ;
		root = last = node ;
	}

	void add ( int c ) {
		P_Node p = last , np = node + ( ++ cnt ) ;
		np->newnode () ;
		np->l = np->len = p->len + 1 ;
		last = np ;
		for ( ; p && !p->next[c] ; p = p->fail ) p->next[c] = np ;
		if ( !p ) np->fail = root ;
		else {
			if ( p->len + 1 == p->next[c]->len ) np->fail = p->next[c] ;
			else {
				P_Node q = p->next[c] , nq = node + ( ++ cnt ) ;
				*nq = *q ;
				nq->len = p->len + 1 ;
				nq->l = np->len ;
				q->fail = np->fail = nq ;
				for ( ; p && p->next[c] == q ; p = p->fail ) p->next[c] = nq ;
			}
		}
	}
} ;

SAM sam ;
char s[MAXN] ;
int n ;

void solve () {
	sam.init () ;
	scanf ( "%s" , s ) ;
	n = strlen ( s ) ;
	rep ( i , 0 , n ) sam.add ( s[i] - 'a' ) ;
	rep ( i , 0 , n ) sam.add ( s[i] - 'a' ) ;
	P_Node now = sam.root ;
	rep ( i , 0 , n ) {
		rep ( j , 0 , W ) if ( now->next[j] ) {
			now = now->next[j] ;
			break ;
		}
	}
	printf ( "%d\n" , now->l - n + 1 ) ;
}

int main () {
	int T ;
	scanf ( "%d" , &T ) ;
	For ( i , 1 , T ) solve () ;
	return 0 ;
}


阅读更多
换一批

Glass Beads

09-30

DescriptionnnOnce 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. nnThe 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. nnThe 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. nnThe 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 < binInputnnThe 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.nOutputnnFor 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.nSample Inputnn4nhelloworldnamandamandandontcallmebfunaaabaaanSample Outputnn10n11n6n5

没有更多推荐了,返回首页