摘要： Time Limit:2000MSMemory Limit:30000KTotal Submissions:6988Accepted:1600DescriptionNemo is a naughty boy. One day he went into the deep sea all by himself. Unfortunately, he became lost and couldn't find his way home. Therefore, he sent a signal to his father, Marlin, to ask for help.After checki 阅读全文

摘要： Time Limit:7000MSMemory Limit:65536KTotal Submissions:34283Accepted:12295DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending orde 阅读全文