← 返回题目

题库练习 Clear the String

← 上一题下一题 →

A12391 | $Clear the String$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

You are given a string $s$ of length $n$ consisting of lowercase Latin letters. You may apply some operations to this string: in one operation you can delete some contiguous substring of this string, if all letters in the substring you delete are equal. For example, after deleting substring bbbb from string abbbbaccdd we get the string aaccdd. Calculate the minimum number of operations to delete the whole string $s$ .

输入格式

The first line contains one integer $n$ ( $1 \le n \le 500$ ) — the length of string $s$ . The second line contains the string $s$ ( $|s| = n$ ) consisting of lowercase Latin letters.

输出格式

Output a single integer — the minimal number of operation to delete string $s$ .

输入输出样例

输入 #1

5
abaca

输出 #1

输入 #2

8
abcddcba

输出 #2

C++ 编辑器

输入

输出