xuanweiace

分类

2018暑假第一周训练2(1) 2018暑假第三周训练1(1) 2018暑假第三周训练2(1) 2018暑假第五周训练3(1) bfs(6) bzoj(2) Codeforce~(25) dfs(8) dfs+剪枝(1) Dijkstra算法(4) FZU(1) HDU(20) HihoCoder(2) Java(1) KMP~(3) luogu(1) nyoj(1) PAT(2) POJ(11) Python(1) QDU_AP协会17级ST2(1) SPOJ(1) STL(3) tarjan算法~~强连通分量(2) tricks(2) Trie字典树(2) ZOJ(6) 三分(1) 二分(8) 二分图(2) 优先队列(2) 优秀模板(1) 分数规划(1) 分治(1) 创新实验室热身赛2(1) 前缀和(1) 剪枝(2) 动态规划（dp）(33) 匈牙利算法(1) 区间问题(2) 单源最短路(2) 单调栈(1) 博弈问题(3) 字符串问题(4) 尺取法(3) 差分数组(1) 并查集(2) 思维(28) 打表(2) 拓扑排序(2) 数学(4) 数论(4) 最小生成树(2) 最短路(2) 最近公共祖先(1) 未归档(607) 树的直径(1) 模拟(9) 母函数(1) 水题纪念(45) 牛客网(14) 状态压缩(2) 皮(1) 知识点(7) 线段树(4) 背包问题(1) 蓝桥杯(2) 贪心(17) 随笔(3) 随笔啊(1) 题解(1)

/ 注册

全部文章（共943篇）

【HDU - 1116】【POJ - 1386】Play on Words（判断半欧拉图，欧拉通路）

题干： Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is ...

2019-05-07

0 555

【POJ - 2762】Going from u to v or from v to u?（Tarjan缩点，树形dp 或拓扑排序，欧拉图相关）

题干： In order to make their sons brave, Jiajia and Wind take them to a big cave. The cave has n rooms, and one-way corridors connecting some rooms. Ea...

2019-05-06

0 746

*【HDU - 5711】Ingress（tsp旅行商问题，优先队列贪心，状压dp，floyd最短路，图论）

题干： Brickgao, who profited from your accurate calculating last year, made a great deal of money by moving bricks. Now he became ``gay shy fool'' agai...

2019-05-06

0 706

【POJ - 3272】Cow Traffic（dp，建反向图，DAG拓扑图）

题干： The bovine population boom down on the farm has caused serious congestion on the cow trails leading to the barn. Farmer John has decided to condu...

2019-05-06

0 564

*【HDU - 5707】Combine String（dp）

题干： Given three strings aa, bb and cc, your mission is to check whether cc is the combine string of aa and bb. A string cc is said to be the combine...

2019-05-06

0 477

【HDU - 5706】GirlCat（bfs）

题干： As a cute girl, Kotori likes playing ``Hide and Seek'' with cats particularly. Under the influence of Kotori, many girls and cats are playing ``...

2019-05-06

0 558

【POJ - 1486】Sorting Slides（思维建图，二分图求必须边，关建边，图论）

题干： Professor Clumsey is going to give an important talk this afternoon. Unfortunately, he is not a very tidy person and has put all his transparenci...

2019-05-04

0 586

【POJ - 2594】Treasure Exploration（floyd传递闭包 + 最小路径覆盖，图论）

题干： Have you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? I...

2019-05-04

0 517

【POJ - 2195】Going Home（二分图最优匹配，费用流或 KM）

题干： On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically...

2019-05-04

0 506

【POJ - 3020】Antenna Placement （匈牙利算法，二分图最小边覆盖）

题干： The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking r...

2019-05-04

0 559