-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1018_2.cpp
More file actions
75 lines (67 loc) · 1.09 KB
/
Copy path1018_2.cpp
File metadata and controls
75 lines (67 loc) · 1.09 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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
//1018_2
#include <iostream>
#include <cstring>
using namespace std;
#define N 25
struct str{
string s;
int len;
int visit;
} ss[N];
int n;
char ch;
int con[N][N]={0};
int lenn(int l,int r){
int len1=ss[l].len,len2=ss[r].len;
for (int k=1;(k<len1)&&(k<len2);k++)
{
bool flag=1;
for (int i=len1-k,j=0;i<len1;i++,j++)
{
if (ss[l].s[i]!=ss[r].s[j]){
flag=0;break;
}
}
if (flag) return con[l][r]=k;
}
return 0;
}
int dfs(int pos){
int ans=0,m=0;
for (int i=0;i<n;i++){
if (ss[i].visit && con[pos][i]){
ss[i].visit--;
ans=dfs(i);
ans+=ss[i].len-con[pos][i];
if (ans>m) m=ans;
ss[i].visit++;
}
}
return m;
}
int main(){
int m,ans;
cin >> n;
for (int i=0;i<n;i++){
cin >> ss[i].s;
ss[i].len=ss[i].s.length();
ss[i].visit=2;
}
cin >> ch;
for (int i=0;i<n;i++)
for (int j=0;j<n;j++)
lenn(i,j);
m = 0;
for (int i=0;i<n;i++){
if (ss[i].s[0]==ch)
{
ss[i].visit--;
ans=dfs(i);
ans+=ss[i].len;
if (ans>m) m=ans;
ss[i].visit++;
}
}
cout << m;
return 0;
}