- 博客(2)
- 收藏
- 关注
RSS订阅原创 [CF gym]2017-2018 ACM-ICPC, Asia Daejeon Regional Contest E How Many to Be Happy?
原题面： http://codeforces.com/gym/101667/attachments [题意] 给你n个边，定义一个函数F(e) 。F(e)等于删除多少条边后，这条边能加入最小生成树，求所有边的F(e)的总和。[题解] 这道题学长在现场切了，但是我还是想要写一下这个题的题解来回顾一下。 首先，一条边要成为MST上的一条，必...
2018-05-11 21:17:20
726
1
原创 [HDU5217]Brackets
Problem DescriptionMiceren likes playing with brackets. There are N brackets on his desk forming a sequence. In his spare time, he will do Q operations on this sequence, each operation is either of th...
2018-05-11 21:05:28
285
1
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人