QOJ.ac

QOJ

Time Limit: 0.5 s Memory Limit: 512 MB Total points: 100 Hackable ✓

#786. Z 函数

Statistics

题目描述

对于个长度为 $n$ 的字符串 $s$。定义函数 $z[i]$ 表示 $s$ 和 $s[i,n-1]$(即以 $s[i]$ 开头的后缀)的最长公共前缀(LCP)的长度。$z$ 被称为 $s$ 的 Z 函数。特别地,$z[0] = 0$。

给定字符串 $s$,求 $z$。

输入格式

输入只有一行,包含一个只含有小写字母的字符串 $S$。

输出格式

  • $z_0\, z_1\, z_2 \, \cdots \, z_{|S|-1}$

样例数据

样例 1 输入

abacababacbaacbabbabac

样例 1 输出

0 0 1 0 3 0 4 0 1 0 0 1 1 0 0 2 0 0 4 0 1 0

子任务

对于所有数据,$1 \leq |S| \leq 2 \cdot 10^6$。

  • Subtask 1 (30 points): $|S| \leq 10^5$
  • Subtask 2 (70 points): No additional constraints
About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

  1. This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
  2. Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
  3. Issues must be filed in English or Chinese only.
  4. Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0

No issues in this category.