A9110 | Palindrome
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Given a string $s$ , determine if it contains any palindrome of length exactly $100$ as a subsequence. If it has any, print any one of them. If it doesn't have any, print a palindrome that is a subsequence of $s$ and is as long as possible.
输入格式
The only line of the input contains one string $s$ of length $n$ ( $1<=n<=5·10^{4}$ ) containing only lowercase English letters.
输出格式
If $s$ contains a palindrome of length exactly $100$ as a subsequence, print any palindrome of length $100$ which is a subsequence of $s$ . If $s$ doesn't contain any palindromes of length exactly $100$ , print a palindrome that is a subsequence of $s$ and is as long as possible.
If there exists multiple answers, you are allowed to print any of them.
If there exists multiple answers, you are allowed to print any of them.
输入输出样例
输入 #1
bbbabcbbb
输出 #1
bbbcbbb
输入 #2
rquwmzexectvnbanemsmdufrg
输出 #2
rumenanemur
A subsequence of a string is a string that can be derived from it by deleting some characters without changing the order of the remaining characters. A palindrome is a string that reads the same forward or backward.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted