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) 树的直径(1) 模拟(9) 母函数(1) 水题纪念(45) 牛客网(14) 状态压缩(2) 皮(1) 知识点(7) 线段树(4) 背包问题(1) 蓝桥杯(2) 贪心(17) 随笔(3) 随笔啊(1) 题解(1)

/ 注册

全部文章 / 未归档（共607篇）

【2018ACM山东省赛 - G】Games（Nim博弈 + dp）

题干： Problem Description Alice and Bob are playing a stone game. There are nnn piles of stones. In each turn, a player can remove some stones from a ...

2019-05-09

0 562

【2018ACM山东省赛 - E】Sequence（树状数组，思维，优化）

题干： We define an element aia_iai in a sequence "good", if and only if there exists a j(1≤j<i)j(1\le j < i)j(1≤j<i) such that aj&l...

2019-05-09

0 546

【2018ACM山东省赛 - C】Cities（最小生成树变形优化，贪心思维）

题干： Problem Description There are nnn cities in Byteland, and the ithi_{th}ith city has a value aia_iai. The cost of building a bidirectional road...

2019-05-09

1 572

【2018山东省赛 - A】Anagram（贪心，费用流，KM算法）

题干： Problem Description Orz has two strings of the same length: A and B. Now she wants to transform A into an anagram of B (which means, a rearrange...

2019-05-09

0 589

【HDU - 1530】Maximum Clique（最大团问题，图论）

题干： Given a graph G(V, E), a clique is a sub-graph g(v, e), so that for all vertex pairs v1, v2 in v, there exists an edge (v1, v2) in e. Maximum cli...

2019-05-08

0 1282

【FZU - 2039】Pets（二分图匹配，水题）

题干：有n个人，m条狗，然后会给出有一些人不喜欢一些狗就不会购买，问最多能卖多少狗。。 Input There is a single integer T in the first line of the test data indicating that there are T(T≤100...

2019-05-07

0 476

【POJ - 2337】Catenyms（欧拉图相关，欧拉通路输出路径，tricks）

题干： A catenym is a pair of words separated by a period such that the last letter of the first word is the same as the last letter of the second. For ...

2019-05-07

0 498

【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 750

*【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 708