poj 3321 Apple Tree dfs序+线段树

Apple TreeTime Limit: 2000MS Memory Limit: 65536K   DescriptionThere is an apple tree outside of kaka's house. Every aut
9次阅读

POJ 2186 Popular Cows(Targin缩点)

传送门Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 31808 Accepted: 12921DescriptionEvery cow's dre
11次阅读

POJ 3278 Catch That Cow(bfs)

传送门Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 80273 Accepted: 25290DescriptionFarmer John h
9次阅读

POJ 2251 Dungeon Master(3D迷宫 bfs)

传送门Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 28416 Accepted: 11109DescriptionYou are trapp
10次阅读

POJ 1321 棋盘问题(dfs)

传送门棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 38297 Accepted: 18761Description在一个给定形状的棋盘(形状可能是不规则的)上面
6次阅读

POJ_2387_最短路

Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 46859 Accepted: 15941DescriptionBessie i
6次阅读

POJ_3013_最短路

Big Christmas TreeTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 23630 Accepted: 5125DescriptionChristmas is
10次阅读

[POJ1185]炮兵阵地

[POJ1185]炮兵阵地试题描述司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能是平原(用"P"表示),如下图。在每一格平原地形上最多可以布置一支炮兵部队(山地上不能够部署炮兵部队);一支炮兵部队在地图上的攻
7次阅读

[POJ3096]Surprising Strings

[POJ3096]Surprising Strings试题描述The D-pairs of a string of letters are the ordered pairs of letters that are distance D from each other. A st
8次阅读

[POJ1068]Parencodings

[POJ1068]Parencodings试题描述Let S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: q By an integer sequ
12次阅读