摘要:
题目: When FJ's friends visit him on the farm, he likes to show them around. His farm comprises \(N (1 \le N \le 1000)\) fields numbered $ 1..N $, the f 阅读全文
题目: When FJ's friends visit him on the farm, he likes to show them around. His farm comprises \(N (1 \le N \le 1000)\) fields numbered $ 1..N $, the f 阅读全文
posted @ 2026-03-21 17:11
ALPHA_wule
阅读(18)
评论(0)
推荐(0)
摘要:
大意: 给你一个 $ n \times n $ 的矩阵,每个点 $ i,j $ 都有对应的权值 $ a_{i,j} $ 然后你可以走 \(k\) 次,从点 \((i,j)\) 能且仅能 移动到 点\((i,j+1)\) 或 点\((i+1,j)\), 每次从 \((1,1)\) 移动到 \((n,n 阅读全文
posted @ 2026-03-21 14:25
ALPHA_wule
阅读(28)
评论(1)
推荐(0)

浙公网安备 33010602011771号