摘要:
hdu1269迷宫城堡Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6081Accepted Submission(s): 2694Problem... 阅读全文
摘要:
基本概念: 1.割点:若删掉某点后,原连通图分裂为多个子图,则称该点为割点。 2.割点集合:在一个无向连通图中,如果有一个顶点集合,删除这个顶点集合,以及这个集合中所有顶点相关联的边以后,原图变成多个连通块,就称这个点集为割点集合。 3.点连通度:最小割点集合中的顶点数。 4.割边(桥):删掉它之后,图必然会分裂为两个或两个以上的子图。 5.割边集合:如果有一个边集合,删除这个边集合以... 阅读全文
摘要:
hdu:4797LCA:离线算法 阅读全文
摘要:
How far away ?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3653Accepted Submission(s): 1379Prob... 阅读全文
摘要:
#include"stdio.h"#include"string.h"#include"iostream"#include"queue"#define M 111111using namespace std;struct st{ int u,v,next,w;}edge[M*2];int ra... 阅读全文
摘要:
#include"stdio.h"#include"string.h"#include"iostream"using namespace std;const int M=41111;int f[M];struct st{ int x,y;}node[M];int finde(int x,int L... 阅读全文
摘要:
poj(1703)Find them, Catch themTime Limit:1000MSMemory Limit:10000KTotal Submissions:26992Accepted:8188DescriptionThe police office in Tadu City decide... 阅读全文
摘要:
完全背包:1:如果求最大价值且恰好装满,那么在初始化时将dp[0]为0, 其余为负无穷大2:如果求最小价值且恰好装满,那么在初始化时将dp[0]为0, 其余为正无穷大3:如果没有要求恰好装满,则dp[0……n]全初始化为0//提示:在平时求最大值时,一般初始化max为负无穷大,求最小值时,一般初始化... 阅读全文
摘要:
http://http://codeforces.com/problemset/problem/343/AA. Rational Resistancetime limit per test1 secondmemory limit per test256 megabytesinputstandard ... 阅读全文
摘要:
hdu(1171)Big Event in HDUTime Limit:10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19752Accepted Submission(... 阅读全文
摘要:
hdu1233还是畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21371Accepted Submission(s): 9515Prob... 阅读全文
摘要:
字符串二分查找#include"stdio.h"#include"string.h"#include"iostream"#include"stdlib.h"using namespace std;char a[1001][22];char ch[22];int cmp(const void *a,c... 阅读全文
摘要:
map容器一般用于对字符串进行编号,主要用于建图方面,例如把城市名按数字进行编号#include"stdio.h"#include"string.h"#include"iostream"#include"map"using namespace std;mapmp;int main(){ in... 阅读全文
摘要:
Hat’s Words(hdu1247)Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6156 Accepted Submission(s): ... 阅读全文
摘要:
统计难题(hdu1251)Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 14730 Accepted Submission(s): 6347P... 阅读全文
摘要:
#include"string.h"#include"stdio.h"#include"queue"#include"iostream"#include"stdlib.h"#define M 10001using namespace std;struct node{ int next[28]... 阅读全文