codeforces 191A
题意:
题解:
#include <bits\stdc++.h>
using namespace std;
int dp[26][26];
int main() {
int n;
for(cin >> n ; n > 0 ; n--){
string s;
cin >> s;
int len = s.size();
int l = s[0]-'a';
int r = s[len-1]-'a';
for(int i = 0 ; i < 26 ; i++){
if(dp[i][l]){
dp[i][r] = max(dp[i][r], dp[i][l]+len);
}
}
dp[l][r] = max(dp[l][r], len);
}
int ans = 0;
for(int i = 0 ; i < 26 ; i++){
ans = max(ans, dp[i][i]);
}
cout << ans << endl;
return 0;
}