码迷,mamicode.com
首页 >  
搜索关键字:the cows are journey    ( 1818个结果
[ACM] POJ 3258 River Hopscotch (二分,最大化最小值)
River HopscotchTime Limit:2000MSMemory Limit:65536KTotal Submissions:6697Accepted:2893DescriptionEvery year the cows hold an event featuring a peculia...
分类:其他好文   时间:2014-09-19 21:02:56    阅读次数:263
POJ2488:A Knight's Journey(dfs)
http://poj.org/problem?id=2488DescriptionBackground The knight is getting bored of seeing the same black and white squares again and again and has dec...
分类:其他好文   时间:2014-09-19 20:53:26    阅读次数:192
poj 3176 -- Cow Bowling
Cow BowlingTime Limit:1000MSMemory Limit:65536KTotal Submissions:13931Accepted:9230DescriptionThe cows don't use actual bowling balls when they go bow...
分类:其他好文   时间:2014-09-19 11:25:15    阅读次数:196
poj A Knight's Journey(DFS)
题目链接:http://acm.hrbust.edu.cn/vj/index.php?c=problem-problem&id=190592题意:给出p*q的棋盘,从(A,1)开始,走“日”字,问能否走完棋盘上所有的点,如果能,按字典序输出路径;思路:DFS,并保存路径即可,注意处理走的方向顺序in...
分类:其他好文   时间:2014-09-19 01:02:24    阅读次数:281
poj2488--A Knight's Journey(dfs,骑士问题)
A Knight's Journey Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 31147   Accepted: 10655 Description Background  The knight is getting bored of seeing the s...
分类:其他好文   时间:2014-09-18 22:23:34    阅读次数:241
POJ 1990 MooFest
MooFest Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 5339   Accepted: 2300 Description Every year, Farmer John's N (1 <= N <= 20,000) cows attend "MooFest...
分类:其他好文   时间:2014-09-18 22:22:44    阅读次数:316
POJ 2376 Cleaning Shifts(贪心)
Description Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow working on cleaning things up and has divided ...
分类:其他好文   时间:2014-09-18 14:53:14    阅读次数:213
poj3274--Gold Balanced Lineup(hash)
Gold Balanced Lineup Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 12334   Accepted: 3618 Description Farmer John's N cows (1 ≤ N ≤ 100,000) share many sim...
分类:其他好文   时间:2014-09-16 22:15:41    阅读次数:329
POJ2186 Popular Cows ,有向图, Tarjan算法
题意: 给定一个有向图,求有多少个顶点是由任何顶点出发都可达的。 顶点数 定理: 有向无环图中唯一出度为0的点,一定可以由任何点出发均可达 (由于无环,所以从任何点出发往前走,必然终止于一个出度为0的点) 1. 求出所有强连通分量 2. 每个强连通分量缩成一点,则形成一个有向无环图DAG。 3. DAG上面如果有唯一的出度为0的点,则该点能被所有的点可达。那么该...
分类:其他好文   时间:2014-09-15 21:19:19    阅读次数:253
poj1947 Rebuilding Roads
Rebuilding RoadsTime Limit:1000MSMemory Limit:30000KTotal Submissions:9105Accepted:4122DescriptionThe cows have reconstructed Farmer John's farm, with...
分类:其他好文   时间:2014-09-15 21:13:09    阅读次数:231
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!