看流星题(过了80%,python): n = int(input()) s = [int(i) for i in input().split()] t = [int(i) for i in input().split()] t_max = max(t) dp = [0] * (t_max + 1) for i in s: dp[i] += 1 for i in t: dp[i] -= 1 for i in range(1, len(dp)): dp[i] = dp[i] + dp[i-1] for i in range(n): if s[i] == t[i]: dp[s[i]] += 1 m = max(dp) temp = 0 list = [] for i in range(len(dp)): if dp[i] == m: temp += 1 list.append(dp[i]) if i != len(dp)-1 and dp[i+1] != m: temp += 1 for i in range(n): if s[i] == t[i] and i in list: temp -= 1 print(m, temp)