贡献法-算法日常练习记录

最新推荐文章于 2024-10-20 10:43:07 发布

YiYo832

最新推荐文章于 2024-10-20 10:43:07 发布

阅读量339

点赞数 5

分类专栏：算法竞赛学习文章标签：算法

本文链接：https://blog.csdn.net/weixin_64112516/article/details/137412726

版权

算法竞赛学习专栏收录该内容

31 篇文章 0 订阅

订阅专栏

4261. 孤独的照片

4261. 孤独的照片 - AcWing题库

"""
https://www.acwing.com/problem/content/4264/
"""

n = int(input())
s = "#" + input()  #方便下标
l, r = [0] * (n + 10), [0] * (n + 10)

# 从左往右开始计算 
h, g = 0, 0
for i in range(1, n + 1):
    if s[i] == "G":
        l[i] = h
        h = 0
        g += 1
    else:
        l[i] = g
        g = 0
        h += 1
        
# 从右往左开始计算 
h, g = 0, 0
for i in range(n, 0, -1):
    if s[i] == "G":
        r[i] = h
        h = 0
        g += 1
    else:
        r[i] = g
        g = 0
        h += 1

# 枚举遍历
res = 0
for i in range(1, n + 1):
    res += l[i] * r[i] + max(0, l[i] - 1) + max(0, r[i] - 1)
print(res)

5154. 牛的基因学

5154. 牛的基因学 - AcWing题库

感觉更像数学理解题，hhhh

from collections import Counter

n = int(input())
s = input()
MOD = 10 ** 9 + 7
cnt = Counter(s)
max_num = 0
diff = 1
for c in ['A', 'C', 'G', 'T']:
    if cnt[c] > max_num:
        max_num = cnt[c]
        diff = 1
    elif cnt[c] == max_num:
        diff += 1
print(pow(diff, n, MOD))

2868. 子串分值

2868. 子串分值 - AcWing题库

孤独的照片的升级版

"""
https://www.acwing.com/problem/content/2871/
"""


def trans(c):
    return ord(c) - ord('a')


s = input()
n = len(s)
l = [0] * n
r = [0] * n
# 从左到右进行遍历
cnt = [-1] * 26  # 存取a~z最近的下标
for i in range(0, n):
    pivot = trans(s[i])
    if cnt[pivot] == -1:
        l[i] = i
        cnt[pivot] = i
    else:
        l[i] = i - cnt[pivot] - 1
        cnt[pivot] = i
# 从右到左进行遍历
cnt = [-1] * 26
for i in range(n - 1, -1, -1):
    pivot = trans(s[i])
    if cnt[pivot] == -1:
        r[i] = n - i - 1
        cnt[pivot] = i
    else:
        r[i] = cnt[pivot] - i - 1
        cnt[pivot] = i
# 加和
res = 0
for i in range(0, n):
    res += 1 + l[i] * r[i] + max(0, l[i]) + max(0, r[i])
print(res)