POJ 2774 Long Long Message
2015-08-12 12:45
417 查看
Language: Default Long Long Message
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 |
#include <cstring>
const int N = 200010;
char str
;
int wa
, wb
, ws
, wv
, sa
;
bool Cmp(int *r, int a, int b, int l) {
return r[a] == r[b] && r[a + l] == r[b + l];
}
void DA(int n, int m) {
int i, j, p;
int *x = wa, *y = wb, *t;
for (i = 0; i < m; ++i) ws[i] = 0;
for (i = 0; i < n; ++i) ws[x[i] = str[i]]++;
for (i = 1; i < m; ++i) ws[i] += ws[i - 1];
for (i = n - 1; i >= 0; --i) sa[--ws[x[i]]] = i;
for (j = p = 1; p < n; m = p, j *= 2) {
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) ws[i] = 0;
for (i = 0; i < n; ++i) ws[wv[i]]++;
for (i = 1; i < m; ++i) ws[i] += ws[i - 1];
for (i = n - 1; i >= 0; --i) sa[--ws[wv[i]]] = y[i];
t = x, x = y, y = t;
for (x[sa[0]] = 0, p = i = 1; i < n; ++i)
x[sa[i]] = Cmp(y, sa[i - 1], sa[i], j) ? p - 1 : p++;
}
}
int rank
, height
;
void calheight(int n) {
int i, j, k = 0;
for (i = 1; i <= n; ++i) rank[sa[i]] = i;
for (i = 0; i < n; height[rank[i++]] = k)
for (k ? --k : 0, j = sa[rank[i] - 1]; str[i + k] == str[j + k]; ++k);
}
int main() {
scanf("%s", str);
int len1 = strlen(str);
str[len1] = '$';
scanf("%s", str + len1 + 1);
int len2 = strlen(str);
DA(len2 + 1, 256);
calheight(len2);
int ans = -1;
for (int i = 1; i < len2 + 1; ++i)
if (height[i] > ans) {
if ((sa[i - 1] < len1 && sa[i] > len1) || (sa[i - 1] > len1 && sa[i] < len1))
ans = height[i];
}
printf("%d\n", ans);
return 0;
}
相关文章推荐
- elasticsearch查询内容精确匹配
- Qt零基础教程(四) QWidget详解篇
- C# 中的委托和事件
- HDU 1087 Super Jumping! Jumping! Jumping!
- php新手常用的函数(随时更新)
- HDOJ 5379 Mahjong tree 树形DP
- ASP.NET 成功执行Update 的 ExecuteNonQuery() 返回值大于0,但是查看数据库却没有改变
- Mysql注入总结(三)
- HDU 3371 Connect the Cities (克鲁斯卡尔)
- HDU 5374 Tetris
- 绿色线程
- This Activity already has an action bar supplied by the window decor
- PHP SOAP 发送XML
- linux下提示一些基本的命令找不到
- rest接口调用
- C++非循环链表的初始化和反转(指针操作)
- listView item进行更新
- axure团队合作开发原型图
- [leetcode-123]Best Time to Buy and Sell Stock III(c++)
- 欢迎使用CSDN-markdown编辑器