PKU 2774 Long Long Message

Description

The little cat is majoring in physics in the capital of Byterland. A piece of sad news comes to him these days: his mother is getting ill. Being worried about spending so much on railway tickets (Byterland is such a big country, and he has to spend 16 shours on train to his hometown), he decided only to send SMS with his mother.

The little cat lives in an unrich family, so he frequently comes to the mobile service center, to check how much money he has spent on SMS. Yesterday, the computer of service center was broken, and printed two very long messages. The brilliant little cat soon found out:

1. All characters in messages are lowercase Latin letters, without punctuations and spaces.
2. All SMS has been appended to each other – (i+1)-th SMS comes directly after the i-th one – that is why those two messages are quite long.
3. His own SMS has been appended together, but possibly a great many redundancy characters appear leftwards and rightwards due to the broken computer.
E.g: if his SMS is “motheriloveyou”, either long message printed by that machine, would possibly be one of “hahamotheriloveyou”, “motheriloveyoureally”, “motheriloveyouornot”, “bbbmotheriloveyouaaa”, etc.
4. For these broken issues, the little cat has printed his original text twice (so there appears two very long messages). Even though the original text remains the same in two printed messages, the redundancy characters on both sides would be possibly different.

You are given those two very long messages, and you have to output the length of the longest possible original text written by the little cat.

Background:
The SMS in Byterland mobile service are charging in dollars-per-byte. That is why the little cat is worrying about how long could the longest original text be.

Why ask you to write a program? There are four resions:
1. The little cat is so busy these days with physics lessons;
2. The little cat wants to keep what he said to his mother seceret;
3. POJ is such a great Online Judge;
4. The little cat wants to earn some money from POJ, and try to persuade his mother to see the doctor :(

Input

Two strings with lowercase letters on two of the input lines individually. Number of characters in each one will never exceed 100000.

Output

A single line with a single integer number – what is the maximum length of the original text written by the little cat.

Sample Input

yeshowmuchiloveyoumydearmotherreallyicannotbelieveit
yeaphowmuchiloveyoumydearmother

Sample Output

27

 

这不是第一次用后缀数组，但是是第一次用后缀数组的解法。后缀数组还是很高深的。

 

基本思想就是，使用计数排序，如果已经安装k前缀排好，那么2k前缀的排序，就依赖于k前缀的结果。

 

array是当前排序的结果，narray是next array；rank表示的是k前缀的计数统计。最复杂的一段写了注释了。

 

 

 

#include "stdafx.h" //============================================================================ // Name : acmcpp.cpp // Author : Yubo Chow // Version : // Copyright : Your copyright notice // Description : Hello World in C++, Ansi-style //============================================================================ #include <iostream> #include <stdlib.h> #include <stdio.h> #include <queue> #include <math.h> #include <algorithm> #include <set> #include <limits.h> #include <float.h> #include <bitset> #include <cmath> #include <vector> #include <map> #include <list> using namespace std; char message[210001]; int l1, l2, l; int height[210001]; int _array[2][210001]; int _rank[2][210001]; int cnt[210001]; int *array, *rank, *narray, *nrank; void sort() { memset(cnt, 0, 1024); for (int i = 0; i < l; ++i) { ++cnt[message[i]]; } for (int i = 1; i <= 'z'; ++i) { cnt[i] += cnt[i - 1]; } array = _array[0]; rank = _rank[0]; for (int i = l - 1; i >= 0; --i) { array[--cnt[message[i]]] = i; } rank[array[0]] = 0; for (int i = 1; i < l; i++) { rank[array[i]] = rank[array[i - 1]]; if (message[array[i]] != message[array[i - 1]]) { rank[array[i]]++; } } narray = _array[1]; nrank = _rank[1]; for (int k = 1; k < l && rank[array[l - 1]] < l - 1; k <<= 1) { for (int i = 0; i < l; ++i) { cnt[rank[array[i]]] = i + 1; } for (int i = l - 1; i >= 0; --i) { if (array[i] >= k) { narray[--cnt[rank[array[i] - k]]] = array[i] - k; // array[i]是当前的最大值，所以array[i] - k是其相同前缀中（rank相同）的最大值 } } for (int i = l - k; i < l; ++i) { narray[--cnt[rank[i]]] = i; //这些没有k后缀，所以他们是最后面的k个，他的位置已经比较出来了 } nrank[narray[0]] = 0; for (int i = 1; i < l; ++i) { nrank[narray[i]] = nrank[narray[i - 1]]; if (rank[narray[i]] != rank[narray[i - 1]] || rank[narray[i] + k] != rank[narray[i - 1] + k]) {//如果前缀的排名不同，则++；如果前缀相同，但是后缀不同，也++ nrank[narray[i]]++; } } swap(nrank, rank); swap(narray, array); } } int main() { #ifndef ONLINE_JUDGE freopen("case.txt", "r", stdin); #endif gets(message); l1 = strlen(message); gets(message + l1); l2 = strlen(message + l1); l = l1 + l2; sort(); int ret = 0; for (int i = 1; i < l; ++i) { if (((array[i] < l1 && array[i - 1] >= l1) || (array[i] >= l1 && array[i - 1] < l1))) { int hei = 0; while (message[array[i] + hei] == message[array[i - 1] + hei]) { hei++; } ret = max(ret, hei); } } cout << ret << endl; return 0; }