07 2021 档案

Codeforces Round #723 (Div. 2) D. Kill Anton(树状数组)
摘要：目录 DescriptionInputOutputSolutionCode Description 给出一个字符串 s，每次可以交换两个相邻的字符，要构造一个合法的字符串 t，使得 t 变为 s 所需要的操作次数最多 Input 4 ANTON NAAN AAAAAA OAANTTON Output 阅读全文
posted @ 2021-07-29 14:06 Bcoi 阅读(45) 评论(0) 推荐(0)
ARC119 E - Pancakes(模型转化)
摘要：题目链接：点我点我 Score: 800" role="presentation" style="font-size: 114%; position: relative;">800800 points Problem Statement We have a pancake tower which i 阅读全文
posted @ 2021-07-09 19:40 Bcoi 阅读(114) 评论(0) 推荐(0)
AtCoder Regular Contest 120 C - Swaps 2(树状数组)
摘要：题目链接：点我点我 Score : 500" role="presentation" style="font-size: 114%; position: relative;">500500 points Problem StatementGiven are two sequences of leng 阅读全文
posted @ 2021-07-09 18:55 Bcoi 阅读(77) 评论(0) 推荐(0)