搜索 DFS - 随笔分类(第4页) - qscqesze

摘要：简单来说，这道题是给你一颗树，然后每个点有一个价值，每个边有一个代价，然后问你，从k点出发，花费最多m/2的代价，能够取得最多的价值是多少。阅读全文

posted @ 2015-03-06 19:05 qscqesze 阅读(265) 评论(0) 推荐(0)

摘要：J - Watashi's BG Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 3631Appoint description:DescriptionWatas... 阅读全文

posted @ 2015-03-05 21:02 qscqesze 阅读(241) 评论(0) 推荐(0)

poj 1088 滑雪记忆化搜索

摘要：滑雪Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 79919Accepted: 29747DescriptionMichael 喜欢滑雪百这并不奇怪，因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你... 阅读全文

posted @ 2015-03-05 13:53 qscqesze 阅读(621) 评论(0) 推荐(0)

SCC缩点

摘要：int V; //顶点数量vector G[max_v]; //图的邻接表表示方法vector rG[max_v]; //把边反向建的图vector vs; //后序遍历顺序的顶点列表bool used[max_v]; //访问标记int cmp[max_v]; ... 阅读全文

posted @ 2015-02-14 16:06 qscqesze 阅读(657) 评论(0) 推荐(1)

Uva 5002 - The Queue DFS

摘要：On some special occasions Nadia’s company provide very special lunch for all employees of the company. Before the food is served all of the employees ... 阅读全文

posted @ 2015-01-19 10:16 qscqesze 阅读(337) 评论(0) 推荐(0)

HDU 1269 移动城堡联通分量 Tarjan

摘要：迷宫城堡Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8211Accepted Submission(s): 3669Problem Descri... 阅读全文

posted @ 2015-01-14 22:24 qscqesze 阅读(246) 评论(0) 推荐(0)

qscqesze

躺尸选手

随笔分类 - 搜索 DFS