该文被密码保护。 阅读全文
posted @ 2023-09-30 21:20
灰鲭鲨
阅读(0)
评论(0)
推荐(0)
摘要：
题目描述 You're going to generate an array $ a $ with a length of at most $ n $ , where each $ a_{i} $ equals either $ 1 $ or $ -1 $ . You generate this a 阅读全文
posted @ 2023-09-25 11:37
灰鲭鲨
阅读(33)
评论(0)
推荐(0)
摘要：
题目描述 Steve Rogers is fascinated with new vibranium shields S.H.I.E.L.D gave him. They're all uncolored. There are $ n $ shields in total, the $ i $ -t 阅读全文
posted @ 2023-09-25 11:22
灰鲭鲨
阅读(19)
评论(0)
推荐(0)
摘要：
Problem StatementSnuke runs a bakery. He is planning for the next $N$ days. Let us call these days Day $1,2,\cdots,N$. At the moment, the bakery hires 阅读全文
posted @ 2023-09-25 11:10
灰鲭鲨
阅读(26)
评论(0)
推荐(0)
摘要：
最大权闭合子图 建网络流图，原图的边流量 \(\infty\)。设点权为 \(v_i\)，那么对于 \(v_i<0\) 向汇点连流量 \(-v_i\)。对于 \(v_i>0\)，向源点连 \(v_i\)。设 \(s=\sum_{v_i>0}v_i\)，网络流流量 \(c\)，最大权闭合子图 \(s- 阅读全文
posted @ 2023-09-25 10:58
灰鲭鲨
阅读(27)
评论(0)
推荐(0)
该文被密码保护。 阅读全文
posted @ 2023-09-25 10:28
灰鲭鲨
阅读(0)
评论(0)
推荐(0)
摘要：
Problem StatementYou are given an integer sequence of length $N$: $A_1,A_2,...,A_N$. Let us perform $Q$ operations in order. The $i$-th operation is d 阅读全文
posted @ 2023-09-22 20:50
灰鲭鲨
阅读(23)
评论(0)
推荐(0)
摘要：
This is a harder version of the problem. In this version, \(n \le 7\).Marek is working hard on creating strong test cases to his new algorithmic probl 阅读全文
posted @ 2023-09-22 20:35
灰鲭鲨
阅读(112)
评论(0)
推荐(0)
摘要：
Problem StatementThere is a tree with $N$ vertices numbered $1$ to $N$. The $i$-th edge connects vertices $A_i$ and $B_i$. Let us keep performing the 阅读全文
posted @ 2023-09-22 20:06
灰鲭鲨
阅读(46)
评论(0)
推荐(0)
浙公网安备 33010602011771号