![](https://img-blog.csdnimg.cn/20190927151117521.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
codeforces
文章平均质量分 95
cf
鱼香rose__
学习算法中...
展开
-
Codeforces Round 946 (Div.3)
Codeforces Round 946 (Div.3) Problems A. Phone DesktopProblems B. Symmetric EncodingProblems C. Beautiful Triple PairsProblems D. Ingenuity-2Problems E. Money Buys Happiness原创 2024-05-21 22:42:23 · 725 阅读 · 0 评论 -
codeforces 936(Div3) C.Tree Cutting
codeforces 936(Div3) C.TreeCutting给出一颗有n个节点的树,然后给出n−1条边的情况。然后给出一个k,要求删掉树中的k条边,要求删掉边后的节点最少的子树的节点数最多。(1≤k原创 2024-05-19 22:49:45 · 601 阅读 · 0 评论 -
Codeforces Round 943(Div.3) F.Equal XOR Segments
Codeforces Round 943(Div.3) F.Equal XOR Segments原创 2024-05-04 19:54:20 · 1141 阅读 · 0 评论 -
Codeforces Round 934 (Div. 2) D
Codeforces Round 934 (Div. 2)D. Non-Palindromic SubstringManacharcodeforces给出一个字符串$s$,然后给出若干次查询,每次查询是对$s$的子段$s[l,r]$进行判断,具体为:**对于子段$ s[l,r]$中长度为$k$的子串,如果存在不是回文的子串,则将该长度$k$加上**。对于每次查询,输出子段$s[l,r]$的长度之和。**这是一道考察$Manachar$算法的好题。**原创 2024-04-27 10:36:43 · 989 阅读 · 0 评论 -
Codeforces\ Round\ 930(C.Bitwise Operation Wizard)
Codeforces\ Round\ 930(C.Bitwise Operation Wizard)算法竞赛交互题原创 2024-03-21 01:10:58 · 440 阅读 · 0 评论 -
Codeforces Round 923 (Div. 3)(A-E)
Codeforces Round 923 (Div. 3)(A-E)A. Make it WhiteB. Following the StringC. Choose the Different Ones!D. Find the Different Ones!E. Klever Permutation原创 2024-02-07 10:22:40 · 807 阅读 · 2 评论 -
codeforces 1534C.Little Alawn‘s Puzzle
1534C.Little Alawn's Puzzle原创 2024-02-05 22:43:13 · 910 阅读 · 0 评论 -
Codeforces Round 922 (Div. 2)(ABC)
Codeforces Round 922 (Div. 2)A. Brick WallB. Minimize InversionsC. XOR-distance原创 2024-01-31 20:55:53 · 755 阅读 · 0 评论 -
Educational Codeforces Round 161 (A,B,C)
Educational Codeforces Round 161 (Rated for Div. 2)A. Tricky TemplateB. Forming TrianglesC. Closest Cities原创 2024-01-23 14:35:14 · 950 阅读 · 0 评论 -
Codeforces Round 920 (Div. 3)(A-E)
Codeforces Round 920 (Div. 3) Problems A. Square Problems B. Arranging CatsProblems C. Sending MessagesProblems D. Very Different ArrayProblems E. Eat the Chip原创 2024-01-17 16:34:46 · 1007 阅读 · 0 评论 -
Codeforces Round 919 (Div. 2)(A-D)
Codeforces Round 919 (Div. 2) Problems A. Satisfying Constraints Problems B. Summation GameProblems C. Partitioning the ArrayProblems D. Array Repetition原创 2024-01-17 01:16:08 · 1244 阅读 · 0 评论 -
Codeforces Round 916 (Div. 3)(A~F)
根据题目设置的游戏条件,每次一个人选择一个颜色的弹珠,然后将自己的该弹珠个数减一,并将对方的减为零,当有一方该颜色弹珠个数为零时不能选择改颜色。每个任务有两个经验值,第一个经验值是第一次完成任务时能获得的经验值,第二个经验值是之后重复完成时每次能获得的经验值。按照最优方式,玩家选择的颜色顺序是根据两玩家该颜色总和降序来选,因此我们按照总和最大对颜色进行排序,然后进行遍历。的数组,要求从每个数组中选择一个数,要求选择的三个整数下标互不相同且总和最大。个任务中第二个经验值最大的任务来做。原创 2023-12-20 18:38:16 · 935 阅读 · 0 评论