PSQ的专栏

hdu3594 Cactus Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1131    Accepted Submission(s): 542 Problem Description 1. It i

Traffic Real Time Query System Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1929    Accepted Submission(s): 380 Problem Descripti

http://poj.org/problem?id=2553

poj3177

hdu3849链接 题目大意：给出一些字符串网络联通图，问有多少个关键路径破坏后使图不连通，若图本身不连通的时候就直接输出0 程序： #include"string.h" #include"stdio.h" #include"iostream" #include"stdlib.h" #define M 10009 #define inf 999999999 #include"map" #in

hdu4612

poj2117 Electricity Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 3603   Accepted: 1213 Description Blackouts and Dark Nights (also known as ACM++)

迷宫城堡 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6081    Accepted Submission(s): 2694 Problem Description 为了训练小希的方向感，Gardon建立了一

点击打开链接 题目链接:   hdu 4738 题目大意:   曹操有N个岛，这些岛用M座桥连接起来                   每座桥有士兵把守(也可能没有)                   周瑜想让这N个岛不连通，但只能炸掉一座桥                   并且炸掉一座桥需要派出不小于守桥士兵数的人去 解题思路:   首

hdu3836 求出强分量后缩点处理得到分支图，对分支图的每个强连通分量统计出度和入度。需要的边数就是：统计 入度=0 的顶点数 和 出度=0 的顶点数，选择两者中较大的一个，才能确保一个强连通图。 程序： #include"string.h" #include"stdio.h" #include"iostream" #include"stack" #define inf 999

Network Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 7082   Accepted: 2555 Description A network administrator manages a large network. The network consis