字符串问题 - 题目

#6624. 字符串问题

统计

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

JB 讨厌解决字符串问题。因此，当他的朋友 Potato 给他一个字符串问题时，他会立即把它交给你，然后继续玩世界上最棒的游戏——《原神》。

给定一个字符串，对于每一个非空前缀，你需要找到字典序最大的子串，并指出该最大子串在当前前缀中出现的最左侧位置。

输入格式

仅一行，包含一个字符串 $S$ ($1 \le |S| \le 10^6$)，由小写拉丁字母 $a$ 到 $z$ 组成。

输出格式

输出 $|S|$ 行，第 $i$ 行包含两个整数 $l_i$ 和 $r_i$，表示长度为 $i$ 的前缀中字典序最大的子串的最左侧出现位置（起始下标为 $1$）。

样例

样例输入 1

potato

样例输出 1

样例输入 2

pbpbppb

样例输出 2

Editorials

ID	Type	Status	Title	Posted By	Last Updated	Actions
#890	Editorial	Open	New Editorial for Problem #6624	qqqaaazzz	2026-01-29 20:08:35	View

Discussions

About Discussions

The discussion section is only for posting: 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.

Open Discussions 0

No discussions in this category.

Issues

About Issues

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:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0