Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

2337究竟该怎么做?

Posted by newpoo at 2007-01-04 13:50:24 on Problem 2337
我的思路是用有向图来表示

把每个单词当成一条有向边,每个字母为一个顶点

然后就是求欧拉迹

可是实现起来却好象很麻烦:
1.首先要判断是否为连通图
2.在找欧拉迹的时候用哪些数据结构比较好

不知道有没有什么更好的办法

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator