Hi. I read problem analysis <https://codingcompetitions.withgoogle.com/codejam/round/00000000008778ec/0000000000b158f8#analysis>. And I don't fully understand how to get O(N!×N) time complexity. Can someone explain?
Test for example: 1 10 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 4 4 3 5 0 0 5 -3 4 -4 3 -5 0 3 -4 4 -3 0 -5 42 42 -- -- You received this message because you are subscribed to the Google Groups Code Jam group. To post to this group, send email to google-code@googlegroups.com. To unsubscribe from this group, send email to google-code+unsubscr...@googlegroups.com. For more options, visit this group at https://groups.google.com/d/forum/google-code?hl=en --- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to google-code+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/60c1c99e-4858-4275-a41f-58242a9d8867n%40googlegroups.com.
