关闭

FZU Problem 1919 K-way Merging sort(大数+记忆化搜索)

传送门As we all known, merge sort is an O(nlogn) comparison-based sorting algorithm. The merge sort achieves its good runtime by a divide-and-conquer strategy, namely, that of halving the list being sorte...
阅读(541) 评论(0)

迷宫的最短路径 -- BFS

#include #include #include #include #include #include #include #include #include #include using namespace std; #define MM(a) memset(a,0,sizeof(a)) typedef long long LL; typedef unsigned lo...
阅读(407) 评论(0)

BFS 模板 【迷宫的最短路径】

#include #include #include #include #include #include #include #include #include #include using namespace std; #define MM(a) memset(a,0,sizeof(a)) typedef long long LL; typedef unsigned lo...
阅读(452) 评论(0)

2015 南阳 CCPC G.Ancient Go

dfs搜索...
阅读(887) 评论(0)

Fire Game [kuangbin带你飞]专题一 简单搜索

点击打开链接 I - Fire Game Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Practice FZU 2150 Description Fat brother and Maze are play...
阅读(451) 评论(0)

poj 3087 Shuffle'm Up (kuangbin带你飞--简单搜索)

Shuffle'm Up Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 7739   Accepted: 3559 Description A common pastime for poker players at a poker table is to shuf...
阅读(346) 评论(0)

poj 3414 (POTS) (BFS)

Pots Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 12295   Accepted: 5190   Special Judge Description You are given two pots, having the volume of A and ...
阅读(329) 评论(0)

hdu 2612 Find a way (BFS)

Find a way Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6758    Accepted Submission(s): 2253 Problem Description Pass a year lea...
阅读(327) 评论(0)

hdu 1495 非常可乐(BFS)

click here ~~ Problem Description 大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 (正好装满一瓶) ,它们三个之间可以...
阅读(340) 评论(0)

UVA 11624

点击打开链接 /* 2015 - 09 - 14 晚上 Author: ITAK Motto: 今日的我要超越昨日的我,明日的我要胜过今日的我, 以创作出更好的代码为目标,不断地超越自己。 */ #include #include #include #include #include #include #include #include using namespac...
阅读(280) 评论(0)

poj 3984 迷宫问题

点击打开链接 迷宫问题 Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 11739   Accepted: 7023 Description 定义一个二维数组:  int maze[5][5] = { 0, 1, 0, 0, 0, 0...
阅读(338) 评论(0)

poj 1426 Find The Multiple ( dfs )

点击打开链接 Find The Multiple Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 22234   Accepted: 9128   Special Judge Description Given a positive int...
阅读(428) 评论(0)

poj 3126 Prime Path

Prime Path Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 14374   Accepted: 8112 Description The ministers of the cabinet were quite upset by the message fr...
阅读(313) 评论(0)

poj 3278 Catch That Cow

Catch That Cow Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 62146   Accepted: 19460 Description Farmer John has been informed of the location of a fugitiv...
阅读(323) 评论(0)

poj 2251 Dungeon Master(BFS)

Dungeon Master Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 21394   Accepted: 8312 Description You are trapped in a 3D dungeon and need to find the quicke...
阅读(305) 评论(0)
21条 共2页1 2 下一页 尾页
    个人资料
    • 访问:466244次
    • 积分:10879
    • 等级:
    • 排名:第1626名
    • 原创:634篇
    • 转载:5篇
    • 译文:0篇
    • 评论:93条
    博客专栏