Algorithm Tag

2015

07-15

POJ 1436 Horizontally Visible Segments (线段树·区间染色)

07-13

POJ 2886 Who Gets the Most Candies?(线段树·约瑟夫环)

07-13

POJ 2828 Buy Tickets(线段树·插队)

07-12

LightOJ 1215 Finding LCM(数论)

07-10

ZOJ 1364 Machine Schedule(二分图最大匹配)

07-10

ZOJ 3761 Easy billiards (DFS性质)

07-08

ZOJ 3699 Dakar Rally(贪心)

07-06

POJ 2823 Sliding Window(单调队列)

07-05

HDU 1043 Eight (BFS·八数码·康托展开)

07-05

XTU1238 Segment Tree (线段树·区间最值更新)

05-25

hiho一下·47 拓扑排序·一(判断是否能够Topo排序)

04-22

HDU 3974 Assign the task(树并查集)

04-22

HDU 1540 Tunnel Warfare(线段树区间合并最大连续区间)

04-19

HDU 4027 Can you answer these queries?(线段树区间不等更新)

04-18

POJ 2528 Mayor's posters(离散化线段树贴海报)

04-15

Codeforces 535C Tavas and Karafs(二分)

04-14

HDU 4006 The kth great number(优先队列·第K大数)

04-14

HDU 1166 敌兵布阵 (树状数组·线段树)

04-13

Codeforces 534D Handshakes(贪心)

04-13

Codeforces 534B Covered Path(贪心)

04-13

hiho一下·41 骨牌覆盖问题·一(矩阵快速幂·费波拉契)

04-10

POJ 2299 Ultra-QuickSort(归并排序·树状数组·逆序对)

04-07

Codeforces 230C Shifts(模拟)

04-07

HDU 3714 Error Curves(3分)

04-03

FZU 2150 Fire Game(DFS+BFS)

04-03

UVa 11624 Fire!(BFS 逃离火灾)

04-02

POJ 3414 Pots(BFS 倒水)

04-02

POJ 3126 Prime Path(BFS 数字处理)

04-01

POJ 1426 Find The Multiple(BFS 同余模定理)

04-01

HDU 1495 非常可乐(BFS 倒水问题)

0%