A8435 | Mission Impassable
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Market stalls now have the long-awaited game The Colder Scrools V: Nvodsk. The game turned out to be difficult as hell and most students can't complete the last quest ("We don't go to Nvodsk..."). That threatened winter exams. The rector already started to wonder whether he should postpone the winter exams till April (in fact, he wanted to complete the quest himself). But all of a sudden a stranger appeared at the door of his office. "Good afternoon. My name is Chuck and I solve any problems" — he said.
And here they are sitting side by side but still they can't complete the mission. The thing is, to kill the final boss one should prove one's perfect skills in the art of managing letters. One should be a real magician to do that. And can you imagine what happens when magicians start competing...
But let's put it more formally: you are given a string and a set of integers $a_{i}$ . You are allowed to choose any substring that is a palindrome and delete it. At that we receive some number of points equal to $a_{k}$ , where $k$ is the length of the deleted palindrome. For some $k$ , $a_{k}=$ -1, which means that deleting palindrome strings of such length is forbidden. After a substring is deleted, the remaining part "shifts together", that is, at no moment of time the string has gaps. The process is repeated while the string has at least one palindrome substring that can be deleted. All gained points are summed up.
Determine what maximum number of points can be earned.
"Oh" — said Chuck, raising from the chair, — "I used to love deleting palindromes, just like you, but one day I took an arrow in the Knee".
And here they are sitting side by side but still they can't complete the mission. The thing is, to kill the final boss one should prove one's perfect skills in the art of managing letters. One should be a real magician to do that. And can you imagine what happens when magicians start competing...
But let's put it more formally: you are given a string and a set of integers $a_{i}$ . You are allowed to choose any substring that is a palindrome and delete it. At that we receive some number of points equal to $a_{k}$ , where $k$ is the length of the deleted palindrome. For some $k$ , $a_{k}=$ -1, which means that deleting palindrome strings of such length is forbidden. After a substring is deleted, the remaining part "shifts together", that is, at no moment of time the string has gaps. The process is repeated while the string has at least one palindrome substring that can be deleted. All gained points are summed up.
Determine what maximum number of points can be earned.
"Oh" — said Chuck, raising from the chair, — "I used to love deleting palindromes, just like you, but one day I took an arrow in the Knee".
输入格式
The first line contains an integer $l$ ( $1<=l<=150$ ) — the length of the string.
The second line contains exactly $l$ integers $a_{k}$ ( $-1<=a_{k}<=10^{5}$ ) — the points a player gains for deleting.
The third line contains exactly $l$ lowercase Latin letters — the original string from which a player can delete palindromes. The line contains no other characters apart from the newline character at the end of the string.
The second line contains exactly $l$ integers $a_{k}$ ( $-1<=a_{k}<=10^{5}$ ) — the points a player gains for deleting.
The third line contains exactly $l$ lowercase Latin letters — the original string from which a player can delete palindromes. The line contains no other characters apart from the newline character at the end of the string.
输出格式
Print a single number — the maximum number of points one can gain if he plays on the given string.
输入输出样例
输入 #1
7 -1 -1 -1 -1 -1 -1 -1 abacaba
输出 #1
0
输入 #2
7 1 -1 -1 -1 -1 -1 -1 abacaba
输出 #2
7
输入 #3
7 1 5 -1 -1 -1 -1 10 abacaba
输出 #3
16
In the first sample we cannot delete any substring, so the best result is $0$ . In the second sample we are allowed to delete only those palindromes whose length equals $1$ , thus, if we delete the whole string, we get $7$ points. In the third sample the optimal strategy is: first we delete character c, then string aa, then bb, and the last one aa. At that we get $1+3*5=16$ points.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted