Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Re:有重边

Posted by neveralso at 2012-12-26 22:57:18 on Problem 3259
In Reply To:有重边 Posted by:sui1999 at 2011-12-06 11:30:41

> wa
> graph[s-1][e-1] = graph[e-1][s-1] = t;  
> 
> ac
> if(graph[s-1][e-1] > t)
>                 graph[s-1][e-1] = graph[e-1][s-1] = t;

有重边+1

Followed by:

Re:有重边 (27) hanzeil 2014-08-13 11:42:47
- Re:有重边 (12) renger_yc 2016-03-05 12:45:24

Post your reply here: