Monica

题意：给一个图，求割点个数#include <cstdio>#include <iostream>#include <cstring>using namespace std;const int MAXN = 110;int low[MAXN], dfn[MAXN], head[MAXN], tail, cnt, timer, n;struct Line{ int to, nxt; }li

DescriptionCaocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn’t give up. Caocao’s army still was not good at water battles, so he came up with another idea. He built m

Time Limit: 10 Sec Memory Limit: 128 MB Submit: 1628 Solved: 635Description现在我们的手头有N个软件，对于一个软件i，它要占用Wi的磁盘空间，它的价值为Vi。我们希望从中选择一些软件安装到一台磁盘容量为M计算机上，使得这些软件的价值尽可能大（即Vi的和最大）。但是现在有个问题：软件之间存在依赖关系，即软件i只有在安装了软