Ldh1315109

分类

/ 注册

全部文章（共36篇）

题解 | Boredom

fmin = lambda x, y: x if x < y else y fmax = lambda x, y: x if x > y else y def solve(testcase): n = II() A = LII() B = [0 for _ i...

2025-11-11

0 5

题解 | 小红蹦跳蹦跳

fmin = lambda x, y: x if x < y else y fmax = lambda x, y: x if x > y else y mod = 10 ** 9 + 7 # @TIME def solve(testcase): n = II() i...

2025-11-11

0 6

题解 | 【模板】差分

def solve(testcase): n, q = MI() A = LII() B = [0, A[0]] for i in range(1, n): B.append(A[i] - A[i - 1]) B.append(0)...

2025-11-11

0 5

题解 | 宵暗的妖怪

fmin = lambda x, y: x if x < y else y fmax = lambda x, y: x if x > y else y # @TIME def solve(testcase): n = II() A = LII() dp = [...

2025-11-11

0 7

题解 | 子数组绝对值的最大值

fmin = lambda x, y: x if x < y else y fmax = lambda x, y: x if x > y else y def solve(testcase): n = II() A = LII() res = 0 m, ...

2025-11-11

0 7

题解 | 最大子数组和

fmin = lambda x, y: x if x < y else y fmax = lambda x, y: x if x > y else y def solve(testcase): n = II() A = LII() if all (a <...

2025-11-11

0 6

题解 | 矩阵的最小路径和

fmin = lambda x, y: x if x < y else y fmax = lambda x, y: x if x > y else y def solve(testcase): n, m = MI() A = [0 for _ in range(m)] ...

2025-11-11

0 6

题解 | 跳台阶

mod = 998244353 def solve(testcase): n = II() a, b = 1, 1 for _ in range(2, n): a, b = b, (a + b) % mod print(b) for testc...

2025-11-09

0 9

题解 | 小红走矩阵

''' Hala Madrid! https://github.com/USYDDonghaoLi/Programming_Competition ''' import sys import os from io import BytesIO, IOBase BUFSIZE = 8192 clas...

2025-11-09

0 10

题解 | 汉诺塔

def f(src, dest, n): if n == 1: print(chr(65 + src), chr(65 + dest)) return else: f(src, 3 - src - dest, n - 1) ...

2025-11-09

0 10