-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathP2187.c
More file actions
48 lines (44 loc) · 1.07 KB
/
P2187.c
File metadata and controls
48 lines (44 loc) · 1.07 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define MAXN 100000
char s[MAXN];
int dp[MAXN];
char pair[2];
bool invalid[26][26];
int max(int a, int b) { return a > b ? a : b; }
int main() {
int n, m;
scanf("%d", &n);
scanf("%s", s);
scanf("%d", &m);
int i, j;
for (i = 0; i < m; i++) {
scanf("%s", pair);
invalid[pair[0] - 'a'][pair[1] - 'a']
= invalid[pair[1] - 'a'][pair[0] - 'a'] = true;
}
//DP
bool invalid_ij;
int ans = 0;
for (i = 0; i < n; i++) {
dp[i] = 1;
for (j = i - 1; j >= 0; j--) {
invalid_ij = invalid[s[i] - 'a'][s[j] - 'a'];
if (s[i] != s[j]) {
if (invalid_ij) continue;
dp[i] = max(dp[i], dp[j] + 1);
}
else {
if (invalid_ij)
dp[i] = max(dp[i], dp[j]);
else
dp[i] = max(dp[i], dp[j] + 1);
break;
}
}
ans = max(ans, dp[i]);
}
printf("%d\n", n - ans);
exit(0);
}