pdd 4.15 第三道题
T = int(input())
res = []
onn = []
while T>=1:
T -= 1
n = int(input())
a = list(map(int, input().split()))
dp = [[0] * n for _ in range(n)]
summ = sum(a)
result = summ
once = n
flag = False
for i in range(n):
dp[0][i] = a[i]
if i > 0 and a[i] == a[0]:
flag = True
if flag:
nums = 1
print(a[0], nums)
continue
for i in range(1, n):
once_i = int(summ / (n - i))
for j in range(i, n):
dp[i][j] = dp[i - 1][j - 1] + a[i]
if dp[i][j] == once_i:
if i + 1 < once:
once = i + 1
result = dp[i][j]
# once = min(once, once_i)
# print("{} {}".format(once, result))
res.append(result)
onn.append(once)
for i in range(len(res)):
print(onn[i],res[i])
但是结果是0%。。无了个大语,不知道为什么,也没时间去找了,好气啊,就这样吧,准备下一场
res = []
onn = []
while T>=1:
T -= 1
n = int(input())
a = list(map(int, input().split()))
dp = [[0] * n for _ in range(n)]
summ = sum(a)
result = summ
once = n
flag = False
for i in range(n):
dp[0][i] = a[i]
if i > 0 and a[i] == a[0]:
flag = True
if flag:
nums = 1
print(a[0], nums)
continue
for i in range(1, n):
once_i = int(summ / (n - i))
for j in range(i, n):
dp[i][j] = dp[i - 1][j - 1] + a[i]
if dp[i][j] == once_i:
if i + 1 < once:
once = i + 1
result = dp[i][j]
# once = min(once, once_i)
# print("{} {}".format(once, result))
res.append(result)
onn.append(once)
for i in range(len(res)):
print(onn[i],res[i])
但是结果是0%。。无了个大语,不知道为什么,也没时间去找了,好气啊,就这样吧,准备下一场
全部评论
相关推荐
04-15 23:34
The University of New South Wales 测试工程师 点赞 评论 收藏
分享

点赞 评论 收藏
分享
点赞 评论 收藏
分享