输出欧拉回路或者欧拉路径长度,如果是欧拉路径,则用floyd求起点到终点的最短路加上即可
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
const int maxn=10000;
const int INF=1000000000;
string tmp;
int grid[30][30],deg[30],ans;
void solve()
{
int cnt=0,se[5];
for(int i=0;i<26;i++)
if(deg[i]%2)
se[cnt++]=i;
if(cnt==0)
printf("%d\n",ans);
else
{
int st=se[0],en=se[1];
for(int k=0;k<26;k++)
for(int i=0;i<26;i++)
for(int j=0;j<26;j++)
grid[i][j]=min(grid[i][j],grid[i][k]+grid[k][j]);
ans+=grid[st][en];
printf("%d\n",ans);
}
}
void process()
{
int u,v,len;
len=tmp.size();
u=tmp[0]-'a',v=tmp[len-1]-'a';
grid[u][v]=len,grid[v][u]=len;
deg[u]++,deg[v]++;
ans+=len;
}
int main()
{
freopen("in.txt","r",stdin);
while(cin>>tmp)
{
for(int i=0;i<26;i++)
for(int j=0;j<26;j++)grid[i][j]=INF;
memset(deg,0,sizeof(deg));
ans=0;
process();
while(cin>>tmp,tmp!="deadend")
process();
solve();
}
return 0;
}