def find_longest_subsequence(sequence, target_sum):nums = list(map(int, sequence.split(',')))max_length = -1n = len(nums)for left in range(n):current_sum = 0for right in range(left, n):current_sum += nums[right]if current_sum == target_sum:current_length = right - left + 1if current_length > max_length:max_length = current_lengthelif current_sum > target_sum:break # 提前终止，因为后续增加只会使和更大return max_length# 读取输入sequence = input.striptarget_sum = int(input.strip)# 调用函数并输出结果print(find_longest_subsequence(sequence, target_sum))摘要：def find_longest_subsequence(sequence, target_sum):nums = list(map(int, sequence.split(',')))max_length = -1n = len(nums)for left
来源：聋哑学校
