算法：和最大的连续降序字符【字符串】

和最大的连续降序字符

Description

Archana is very fond of strings. She likes to solve many questions related to strings. She comes across a problem which she is unable to solve. Help her to solve. The problem is as follows: Given is a string of length L. Her task is to find the longest string from the given string with characters arranged in descending order of their ASCII code and in arithmetic progression. She wants the common difference should be as low as possible(at least 1) and the characters of the string to be of higher ASCII value.

Input

The first line of input contains an integer T denoting the number of test cases. Each test contains a string s of lengthL.

1<= T <= 100

3<= L <=1000

A<=s[i]<=Z

The string contains minimum three different characters.

Output

For each test case print the longest string.Case 1:Two strings of maximum length are possible- “CBA” and “RPQ”. But he wants the string to be of higher ASCII value therefore, the output is “RPQ”.Case 2:The String of maximum length is “JGDA”.

Sample Input 1

2
ABCPQR
ADGJPRT

Sample Output 1

RQP
JGDA

思路

1. 在给定的字符串中在任意位置选取任意个数的字符,这些字符必须满足它们之间的差相同,比如ABC,ACE, ACEG,BDFH
2. 将满足1的字符串中选取最长的某些字符串,比如 ACEG … BDFH等等
3. 在满足2的字符串中选取其ASC码最大的字符串比如BDFH
4. 将满足3的字符串逆序输出

python

时间复杂度: O(n3)

步骤:

1. 因为可以从任意位置选取任意多的字符,所以首先将给定字符串转成减掉A后的ASCII码,这样A对应0,B对应1…,Z对应25,并进行去重和排序
2. 创建数组,将给定的字符位置标记为1,没有的标记为0
3. 遍历数组,对标记为1的数,分别进行距离为1,2…k的探测,记录满足条件的数
4. 输出最佳答案
   这样每次遍历的都是以第i个数开头的,以距离为1,2…k的串
   参考

# 和最大的连续降序子字符串


def maxSum_str(index_arr):
    max_count = 0
    max_res = ""
    for i in range(len(index_arr)):
        if index_arr[i] == 1:
            k = 1   # 初始步长为1
            while i + k < len(index_arr):
                count = 0
                res = ""
                for j in range(i, len(index_arr), k):   # 以该步长遍历数组，寻找相同步长最长子字符串
                    if index_arr[j] == 1:   # 满足条件就计数，不满就跳出
                        count += 1
                        res = chr(j + ord('A')) + res  # 逆序
                    else:
                        break
                if count > max_count:
                    max_count = count
                    max_res = res
                elif count == max_count:
                    if res[0] > max_res[0]: # 长度相等则选ASCII码大的
                        max_res = res
                k += 1
    return max_res


if __name__ == '__main__':
    for _ in range(int(input())):
        s = input()
        s_arr = sorted(set(list(map(lambda x: ord(x) - ord('A'), s))))  # 转换为ASCII码列表，去重，排序
        index_arr = [0] * 26    # 标记数组
        for i in s_arr:
            index_arr[i] = 1
        result = maxSum_str(index_arr)
        print(result.strip())