差分-算法日常练习记录

最新推荐文章于 2024-05-06 11:15:59 发布

YiYo832

最新推荐文章于 2024-05-06 11:15:59 发布

阅读量193

点赞数 1

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

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

版权

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

31 篇文章 0 订阅

订阅专栏

AcWing 4262. 空调

4262. 空调 - AcWing题库

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

n = int(input())
first = [0] + list(map(int, input().split()))
second = [0] + list(map(int, input().split()))
arr = [0 for i in range(0, n + 10)]
for i in range(1, n + 1):
    arr[i] = first[i] - second[i]
# print(arr)
res = 0
for i in range(1, n + 2):
    if arr[i] - arr[i - 1]>0:
        res += arr[i] - arr[i - 1]
print(res)

AcWing 5396. 棋盘

5396. 棋盘 - AcWing题库

"""
https://www.acwing.com/problem/content/5399/
"""
n, m = map(int, input().split())
arr = [list(map(int, input().split())) for _ in range(0, m)]
darr = [0 for _ in range(0, n ** 2 + 10)]
for i in range(len(arr)):
    x1, y1, x2, y2 = arr[i]
    for j in range(x1, x2 + 1):
        start = n * (j - 1) + y1
        end = n * (j - 1) + y2 + 1
        darr[start] += 1
        darr[end] -= 1
res = [0 for _ in range(0, n ** 2 + 10)]
for i in range(1, len(res)):
    res[i] = (res[i - 1] + darr[i]) % 2
for i in range(0, n):
    tem = res[1 + i * n:1 + i * n + n]
    tt = ""
    for j in range(len(tem)):
        tt += str(tem[j])
    print(tt)

AcWing 4655. 重新排序

4655. 重新排序 - AcWing题库

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

n = int(input())
arr = [0] + list(map(int, input().split(" ")))
m = int(input())
op = [list(map(int, input().split(" "))) for _ in range(0, m)]
sum_arr = [0 for i in range(0, n + 10)]
d_arr = [0 for i in range(0, n + 10)]
pre = 0
now = 0
for i in range(1, n+1):
    sum_arr[i] = sum_arr[i - 1] + arr[i]
for i in range(len(op)):
    l, r = op[i]
    pre += sum_arr[r] - sum_arr[l - 1]
    d_arr[l] += 1
    d_arr[r + 1] -= 1
for i in range(1,n+1):
    d_arr[i] = d_arr[i] + d_arr[i-1]
d_arr.sort(reverse=True)
arr.sort(reverse=True)
for i in range(0, n):
    if d_arr[i] > 0:
        now += d_arr[i] * arr[i]
print(now - pre)