该文被密码保护。 阅读全文
摘要：
题目描述 You're going to generate an array aa with a length of at most nn , where each aiai equals either 11 or −1−1 . You generate this a 阅读全文
摘要：
题目描述 Steve Rogers is fascinated with new vibranium shields S.H.I.E.L.D gave him. They're all uncolored. There are nn shields in total, the ii -t 阅读全文
摘要：
Problem StatementSnuke runs a bakery. He is planning for the next NN days. Let us call these days Day 1,2,⋯,N1,2,⋯,N. At the moment, the bakery hires 阅读全文
摘要：
最大权闭合子图 建网络流图，原图的边流量 ∞∞。设点权为 vivi，那么对于 vi<0vi<0 向汇点连流量 −vi−vi。对于 vi>0vi>0，向源点连 vivi。设 s=∑vi>0vis=∑vi>0vi，网络流流量 cc，最大权闭合子图 \(s- 阅读全文
该文被密码保护。 阅读全文
摘要：
Problem StatementYou are given an integer sequence of length NN: A1,A2,...,ANA1,A2,...,AN. Let us perform QQ operations in order. The ii-th operation is d 阅读全文
摘要：
This is a harder version of the problem. In this version, n≤7n≤7.Marek is working hard on creating strong test cases to his new algorithmic probl 阅读全文
摘要：
Problem StatementThere is a tree with NN vertices numbered 11 to NN. The ii-th edge connects vertices AiAi and BiBi. Let us keep performing the 阅读全文
