This prob deal with flows ,I think it means make every flow is shortest, so every time chioce the lowest position as next position ,and we consider every flow as a word.
在2009-09-05?11:53:00，"Cong?Thanh?Tran"?<[email protected]>?写道： > >Look?at?the?sample?in?the?problem: >9?6?3 >5?9?6 >3?5?9 > >There?are?two?basins?for?the?above?problem,?so?there?are?2?possible >ways?to?name?them: >a?b?b >a?a?b >a?a?a >which?has?the?result?string:?abbaabaaa >OR > >b?a?a >b?b?a >b?b?b >which?has?the?result?string:?baabbabbb > >Because?of?lexicographical?order?(dictionary?order),?we?have?to?choose >the?first?result. > > >On?Sep?5,?1:09?am,?Wang?lei?<[email protected]>?wrote: >>?Hi?: >>?i?am?not?English?native?speaker,?how?to?understand?'the?resulting?string?is >>?lexicographically?smallest' >> >>?per?my?understanding,?the?basin?with?more?members?should?be?label?with >>?smaller?character. >> >>?But?it?seems?my?understanding?is?wrong, >> --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/google-code?hl=en -~----------~----~----~----~------~----~------~--~---
