##搜索
关注
分享
扫一扫
GDRetop
数据研发专家，ETL工程师
展开
-
hdu 5487 Difference of Languages BFS
Difference of LanguagesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 526 Accepted Submission(s): 120Problem DescriptionA re原创 2015-10-06 16:23:31 · 697 阅读 · 0 评论 -
hdu 1067 Gap bfs+hash
t#include#include#include#include#includeusing namespace std;struct Node{ int map[4][8];};int map1[4][8];Node queue[100001];sethaha;int dist[100001];int en;int原创 2014-09-17 11:04:14 · 764 阅读 · 0 评论 -
hdu 4888 Redraw Beautiful Drawings 网络流+搜索
Redraw Beautiful DrawingsTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3760 Accepted Submission(s): 1118Problem Description原创 2014-12-01 22:59:47 · 1118 阅读 · 0 评论 -
2015多校联合训练赛 hdu 5305 Friends 2015 Multi-University Training Contest 2 枚举+剪枝
FriendsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 249 Accepted Submission(s): 103Problem DescriptionThere are n people原创 2015-07-23 20:41:41 · 886 阅读 · 0 评论 -
hdu 3957 Street Fighter 重复覆盖于+精确覆盖 DancingLink
Street FighterTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1257 Accepted Submission(s): 472Problem DescriptionStreet Fig原创 2015-07-26 13:03:32 · 760 阅读 · 1 评论 -
hdu 5335 Walk Out 搜索+贪心
Walk OutTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 141 Accepted Submission(s): 17Problem DescriptionIn an n∗m maze, th原创 2015-07-30 17:55:26 · 1580 阅读 · 2 评论 -
hdu 5348 MZL's endless loop 2015多校联合训练赛#5 找环+dfs
MZL's endless loopTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1837 Accepted Submission(s): 395Special JudgeProblem Descript原创 2015-08-06 09:31:59 · 758 阅读 · 0 评论 -
hdu 5379 Mahjong tree 2015多校联合训练赛#7 dfs
Mahjong treeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 175 Accepted Submission(s): 51Problem DescriptionLittle sun is an原创 2015-08-11 19:05:13 · 622 阅读 · 0 评论 -
UVALive 6265 Graphic Madness 搜索 Regionals 2012 :: Europe - Central
其他题做法：Non-boring sequences求是否任意子串中，都有一个数，这个数只出现一次：方法：跟矩形面积并一样，从右到左做，用线段树维护，对于i位置，如果线段树中恰好有n-i+1个点被覆盖了，说明有解，否则无解。如何构造线段？： 对于a(1)......a(i).......(N)括号里的数字表示位置，a表示一个数有两个a，对于a(2)如果已经走过i位置，且目前原创 2015-08-24 09:07:50 · 493 阅读 · 0 评论 -
hdu 5409 CRB and Graph 2015多校联合训练赛#10 dfs
CRB and GraphTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 238 Accepted Submission(s): 95Problem DescriptionA connected, un原创 2015-09-03 10:29:44 · 671 阅读 · 0 评论