lesileqin的博客

POJ 3180 The Cow Prom 【传送门】Time Limit:1000MS Memory Limit:65536K Total Submissions:3029 Accepted:1743 DescriptionThe N (2 <= N <= 10,000) cows are so excited: it's pr...

POJ 1236 Network of Schools 【传送门】Time Limit:1000MS Memory Limit:10000K Total Submissions:26493 Accepted:10459 DescriptionA number of schools are connected to a computer net...

POJ 2186 Popular cows 【传送门】Time Limit:2000MS Memory Limit:65536K Total Submissions:43139 Accepted:17547 DescriptionEvery cow's dream is to become the most popular cow in th...

Tarjan算法求连通图（代码含所需变量、初始化步骤）：#define MAXN 100000+5//struct edge{// int to;// //int val; //若边有权值所需要的元素//};//int next[MAXN]; vector<int> G[MAXN];int dfn[MAXN],low[MAXN];bool insta...

HDU 1269 迷宫城堡 【传送门】迷宫城堡Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26701Accepted Submission(s): 11339Problem Description为了训练小希的...

UVA 315 Network 【传送门】A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N. No two places have the same nu...

UVA 796 Critical Links 【传送门】求桥，套用Tarjan模板：#include<iostream>#include<cstdio>#include<vector>#include<cstring>#include<stack>#include<queue>#include&...

题目背景割点题目描述给出一个nn个点，mm条边的无向图，求图的割点。输入格式第一行输入n,mn,m下面mm行每行输入x,yx,y表示xx到yy有一条边输出格式第一行输出割点个数第二行按照节点编号从小到大输出节点，用空格隔开输入输出样例输入 #16 71 21 31 42 53 54 55 6输出 #11 5说明/提示...