Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
Re:考虑重边In Reply To:考虑重边 Posted by:zhao0057 at 2006-09-01 13:33:06 重边?是不是这样?也不过! for (i=1; i<=p; i++) { cin >> l >> r >> tm; if (tm < a[l][r]) a[l][r] = tm; a[r][l] = a[l][r]; } Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator