WangMeow --- ᶘ ᵒᴥᵒᶅ ฅ^•ﻌ•^ฅ

Description Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strat

Description There are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your univ

Description An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all compute

题目链接 做法：一开始想复杂了。有一个地方很重要，此图一直保证是无向简单图。也就是说一个n个顶点的图中某点的度最多是是n-1 。其次，我们发现，我们可以先找这个简单图中有多少个连通块，找最多度的顶点所在的连通块，把其余连通块连接在这个顶点上，在最多减掉k条边，再连接上。所以答案一定为min(n-1, 连通块-1 + 最大度数+ k); AC代码： #include<bits/std...

题目传送门 做法： 我们发现，满足题意的区间有以下情况： 1.  [   (  )   ] 2.  [   ]  (   ) 3.  (   )  (   ) 学过数据结构的童鞋都知道利用栈实现括号匹配。同理这个题的解法也是离不开的。 我们把满足题意的区间下标加到并查集里面，然后离线查询就可以判断该区间是不是合法的。 但是，我们要注意这种情况  ----->  () () (...