2014.10.19微软网上测试.docVIP

题目1 : Beautiful String 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 We say a string is beautiful if it has the equal amount of 3 or more continuous letters (in increasing order.) Here are some example of valid beautiful strings: abc, cde, aabbcc, aaabbbccc. Here are some example of invalid beautiful strings: abd, cba, aabbc, zab. Given a string of alphabets containing only lowercase alphabets (a-z), output YES if the string contains a beautiful sub-string, otherwise output NO. 输入 The first line contains an integer number between 1 and 10, indicating how many test cases are followed. For each test case: First line is the number of letters in the string; Second line is the string. String length is less than 10MB. 输出 For each test case, output a single line YES/NO to tell if the string contains a beautiful sub-string. 提示 Huge input. Slow IO method such as Scanner in Java may get TLE. 样例输入 4 3 abc 4 aaab 6 abccde 3 abb 样例输出 YES NO YES NO 题目2 : Performance Log 时间限制:8000ms 单点时限:1000ms 内存限制:256MB 描述 You are given a txt file, which is performance logs of a single-threaded program. Each line has three columns as follow: [Function Name] [TimeStamp] [Action] [FunctionName] is a string of length between 1~255 [TimeStamp] format is hh:mm:ss Valid values for Action column are START or END, marking the start or end of a function call. Each function will only be called once. Output the depth-first traversal result of the call graph with the total time of each function call. However, sometimes the performance log isnt correct and at that time you just need to output Incorrect performance log. 输入 The input only contains 1 case, first line is a positive number N representing the number of logs(1 = N = 20000), then there are N lines in next, each line is the log info containing [Function Name] [TimeStamp] [Action], [Function Name] is a string, you can assume the [Function Name] is distinct and the length between 1~255. 输出 Output the depth-first traversal result of the call graph with the