摘要:
阅读全文
摘要:
流体阻力:F=-kv 阅读全文
摘要:
题意:一开始有n个点m条边,后来每次加一条边,求加上这一条边后途中有几座“桥”。分析:双连通分量View Code #include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;#define maxn 100010struct Edge{ int u,v,next; int vis;}edge[1000005];int head[maxn];int E=0;void addedge(int u,int v){ edge[E].u 阅读全文