每日一题之 hiho201 Composition

描述
Alice writes an English composition with a length of N characters. However, her teacher requires that M illegal pairs of characters cannot be adjacent, and if ‘ab’ cannot be adjacent, ‘ba’ cannot be adjacent either.

In order to meet the requirements, Alice needs to delete some characters.

Please work out the minimum number of characters that need to be deleted.

输入
The first line contains the length of the composition N.

The second line contains N characters, which make up the composition. Each character belongs to ‘a’..’z’.

The third line contains the number of illegal pairs M.

Each of the next M lines contains two characters ch1 and ch2,which cannot be adjacent.

For 20% of the data: 1 ≤ N ≤ 10

For 50% of the data: 1 ≤ N ≤ 1000

For 100% of the data: 1 ≤ N ≤ 100000, M ≤ 200.

输出
One line with an integer indicating the minimum number of characters that need to be deleted.

样例提示
Delete ‘a’ and ‘d’.

样例输入
5
abcde
3
ac
ab
de
样例输出
2

题意：

给出一个长度为n的字符串序列，并且给定m个非法的字符对，假如‘ab’非法，那么‘ba’也是非法的，求最少删除几个字符使得序列合法。

思路：

本题最暴力的解法就是枚举哪些字符被删掉。枚举的复杂度是O(2^N)，再加上O(N)的判断，总复杂度是 O(N