As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
给定字符串 $S$，对每个 $i \in [1, n]$，定义 $\pi_i$ 为 $S[:i]$ 的最长 Border。求数组 $\pi$。
输入只有一行，包含一个只含有小写字母的字符串 $S$。
输出一行，包含 $|S|$ 个整数，描述 $\pi_1, \pi_2, \cdots, \pi_{|S|}$。
abcababcababcbacbabc0 0 0 1 2 1 2 3 4 5 6 7 8 0 1 0 0 1 2 3见下发文件
见下发文件
对于所有数据，$1 \leq |S| \leq 2 \cdot 10^6$。
The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: