04 2017 档案

hdu 1517 博弈论
摘要：先引入必胜点和必败点两个概念：必败点(P点) :前一个选手(Previous player)将取胜的位置称为必败点。必胜点(N点) :下一个选手(Next player)将取胜的位置称为必胜点。对于这两个概念的描述，我开始的时候也搞不懂。其实可以从字面理解，简单说来，就是当你走到某一点的时候，如果你 阅读全文
posted @ 2017-04-23 13:19 Xycdada 阅读(175) 评论(0) 推荐(0)
bfs hdu 2717 Catch That Cow
摘要：Catch That Cow Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14553 Accepted Submission(s): 4422 阅读全文
posted @ 2017-04-22 20:51 Xycdada 阅读(158) 评论(0) 推荐(0)
zoj 2136 Longest Ordered Subsequence
摘要：最长上升子序列 一个数的序列 a i ，当 a 1 < a 2 < # < a N 时，称这个序列是上升的。对于给定的一个序列 （ a 1 , a 2 ,# , a N ），可以得到一些上升子序列（ a i1 , a i 2 ,# , a iK ），这里 1 ≤ i1 < i 2 < # < iK 阅读全文
posted @ 2017-04-20 23:29 Xycdada 阅读(203) 评论(0) 推荐(0)
四舍五入输出
摘要：1 #include<iostream> 2 #include<string> 3 #include<sstream> 4 #include<set> 5 6 using namespace std; 7 8 int main() 9 { 10 double sum=0.345666; 11 cou 阅读全文
posted @ 2017-04-20 22:48 Xycdada 阅读(160) 评论(0) 推荐(0)
hdu 1584 dfs+剪枝
摘要：蜘蛛牌 Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3730 Accepted Submission(s): 1591 Problem De 阅读全文
posted @ 2017-04-17 21:09 Xycdada 阅读(268) 评论(0) 推荐(0)
[kuangbin带你飞]专题一 简单搜索 bfs B - Dungeon Master
摘要：B - Dungeon Master B - Dungeon Master You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes whi 阅读全文
posted @ 2017-04-17 19:55 Xycdada 阅读(180) 评论(0) 推荐(0)
全排列算法（递归）
摘要：1 include<iostream> 2 3 using namespace std; 4 5 int num[5]={1,2,3,4,5}; 6 int sum; 7 8 void swap(int *p,int *q) 9 { 10 int m = *p; 11 *p=*q; 12 *q=m; 阅读全文
posted @ 2017-04-17 18:49 Xycdada 阅读(239) 评论(0) 推荐(1)
hdu 1978 记忆化搜索
摘要：How many ways Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5203 Accepted Submission(s): 3067 P 阅读全文
posted @ 2017-04-15 20:19 Xycdada 阅读(165) 评论(0) 推荐(0)
hdu 1010 dfs+剪枝
摘要：Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 119601 Accepted Submission(s) 阅读全文
posted @ 2017-04-15 11:00 Xycdada 阅读(184) 评论(0) 推荐(0)
hdu 4768 二分
摘要：Flyer Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3148 Accepted Submission(s): 1174 Problem D 阅读全文
posted @ 2017-04-15 09:49 Xycdada 阅读(221) 评论(0) 推荐(0)
hdu 2899 凸性 二分 ／ 三分
摘要：Strange fuction Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7230 Accepted Submission(s): 4996 阅读全文
posted @ 2017-04-15 08:28 Xycdada 阅读(200) 评论(0) 推荐(0)
hdu 2199 二分搜索
摘要：Can you solve this equation? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19647 Accepted Submi 阅读全文
posted @ 2017-04-15 00:03 Xycdada 阅读(192) 评论(0) 推荐(0)
pos 3349 hash哈希
摘要：Snowflake Snow Snowflakes Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 40969 Accepted: 10792 Description You may have heard that no two 阅读全文
posted @ 2017-04-12 21:52 Xycdada 阅读(326) 评论(0) 推荐(0)
codeforces 792 B. Counting-out Rhyme 约瑟夫环
摘要：恢复内容开始 B. Counting-out Rhyme time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output n children a 阅读全文
posted @ 2017-04-11 12:08 Xycdada 阅读(350) 评论(0) 推荐(0)
quicksort
摘要：1 #include<iostream> 2 #include<set> 3 #include<string> 4 #include<cstring> 5 6 using namespace std; 7 8 int num[10]={10,9,8,7,6,5,4,3,2,1}; 9 10 void 阅读全文
posted @ 2017-04-07 22:02 Xycdada 阅读(177) 评论(0) 推荐(0)
hdu 1267 递推
摘要：下沙的沙子有几粒？ Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4326 Accepted Submission(s): 2268 Probl 阅读全文
posted @ 2017-04-07 21:38 Xycdada 阅读(218) 评论(0) 推荐(0)