|
|
What is test case no #37?Or give me some test case.. Try this: ACbcBaAbCBCa, you definetely can connnect them Not correct test.The sequence has exactly n lowercase letters and exactly n uppercase letters. Probably dp is possible Looks like to dp here one should invent something non-trivial because of relatively large n. Edited by author 04.08.2017 10:43 That is a problem about greedy choice. Edited by author 04.08.2017 10:38 I was keep getting timeout from WA44.. dang~ What is test case? Previously I had WA#4, but now my algorithm pass all tests discribed in those topic and fail with WA#7 Edited by author 27.11.2015 14:23 Edited by author 27.11.2015 14:23 Someone have interesting tests? :) Try this: 2 AAaa Answer: 2 1 Edited by author 12.10.2014 18:17 Also try AbaBbABa. Solution should be: 4 3 2 1 aaAAbBAa should be 2 1 3 4 3 AAaAaa 3 1 2 4 bAaAAaaB 2 4 3 1 5 BAaAAaaCcb 5 1 3 2 4 5 bAaAaAacCB 2 3 4 5 1 Try this: 4 ACcabdDB my solution passes all mention above, but failed on this... Should be: 2 1 4 3 Some random tests and right answers: 4 CAaDBbdc Answer: 4 1 3 2 4 AbBcCdDa Answer: 4 1 2 3 5 AaBbCDAadc Answer: 1 2 5 4 3 5 AbCdEeDcBa Answer: 5 4 3 2 1 Good luck! Who can tell me? Thanks! tests: 4 AAaaaaAA output data: (case 1)2 3 1 4 (case 2)3 2 4 1 (case 3)1 2 3 4 (case 4)4 3 2 1 Which is the correct answer? Edited by author 29.11.2014 18:43 Correct answer for this test is 2 1 4 3 RT @Nodir NAZAROV [TUIT-Karshi] Thanks a lot! AC now! Correct answer for this test is 2 1 4 3 |
|
|