persistent codeants

摘要： Problem DescriptionNetwork flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph.InputThe first line of input contains an integer T, denoting the number of test cases. For each test case, the first line contains tw 阅读全文

摘要： 1354. Palindrome. Again PalindromeTime limit: 1.0 second Memory limit: 64 MBAwordis the nonempty sequence of symbolsa1a2…an. Apalindromeis the worda1a2…anthat is read from the left to the right and from the right to the left the same way (a1a2…an=anan−1…a1). IfS1=a1a2…anandS2=b1b2…bm, thenS1S2=a1a2… 阅读全文

摘要： 1423. String TaleTime limit: 1.0 second Memory limit: 64 MBBackgroundI want to tell you a story. Not entirely, but only the very beginning, because the ending of this story became a legend of programming—as well as its heroes.When computers were large, when trees were small, when the sun shined brig 阅读全文