Fork me on GitHub

07 2013 档案

摘要:Free DIY TourTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2735Accepted Submission(s): 889【题目链接】... 阅读全文
posted @ 2013-07-31 15:56 Gifur 阅读(668) 评论(0) 推荐(0) 编辑
摘要:六度分离Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2927Accepted Submission(s): 1127【题目链接】http://a... 阅读全文
posted @ 2013-07-30 13:22 Gifur 阅读(536) 评论(0) 推荐(0) 编辑
摘要:一个人的旅行Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13964Accepted Submission(s): 4691【题目链接】http:... 阅读全文
posted @ 2013-07-30 01:09 Gifur 阅读(831) 评论(0) 推荐(0) 编辑
摘要:最短路径问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8219Accepted Submission(s): 2456[题目链接]http:/... 阅读全文
posted @ 2013-07-29 20:32 Gifur 阅读(2453) 评论(0) 推荐(0) 编辑
摘要:继续畅通工程Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10206Accepted Submission(s): 4451Problem Des... 阅读全文
posted @ 2013-07-29 17:34 Gifur 阅读(305) 评论(0) 推荐(0) 编辑
摘要:【题目链接】http://acm.hdu.edu.cn/showproblem.php?pid=1856【解题思路】给的数据有点大,干脆少开点数组,直接上set存储有朋友的孩子的编号,同时根据编号初始化对应的在father数组中的下标,同时也更新集合,后面开一个数组存储同属于于一个集合的数有多少个(... 阅读全文
posted @ 2013-07-29 13:54 Gifur 阅读(264) 评论(0) 推荐(0) 编辑
摘要:Is It A Tree?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6961Accepted Submission(s): 1619【题目链接... 阅读全文
posted @ 2013-07-29 12:54 Gifur 阅读(387) 评论(0) 推荐(0) 编辑
摘要:【解题思路】这题先看了NotOnlySuccess的解题思路,即设置虚根再处理的做法;弄了一个上午,再次有种赶脚的感觉~~如果需要找出为什么需要去比所有权值之和更大的数为新增的虚边的话,一开始我理解仅是找比最大边权值要大的数就够了,因为这样就已经满足了不会提前找到虚边的情况,但如果是这样的话那就很难... 阅读全文
posted @ 2013-07-27 13:43 Gifur 阅读(432) 评论(0) 推荐(0) 编辑
摘要:Problem ITeen Girl SquadInput:Standard InputOutput:Standard OutputYou are part of a group ofnteenage girls armed withcellphones. You have some news yo... 阅读全文
posted @ 2013-07-27 07:36 Gifur 阅读(1015) 评论(0) 推荐(0) 编辑
摘要:【题目链接】http://poj.org/problem?id=3164【解题思路】百度百科:最小树形图 】里面有详细的解释,而Notonlysucess有精简的模板,下文有对其模板的一点解释,前提是对朱刘算法有所了解【PS】这题没必要写题解,学了朱刘算法并不是表示你就锻炼到了思维了,在看最小树形图... 阅读全文
posted @ 2013-07-26 15:58 Gifur 阅读(319) 评论(0) 推荐(0) 编辑
摘要:【题目链接】http://poj.org/problem?id=2395【解题思路】找最小生成树中权值最大的那条边输出,模板过的,出现了几个问题,开的数据不够大导致运行错误,第一次用模板,理解得不够深厚且模板有错误导致提交错误 1 #include 2 #include 3 #include 4 #... 阅读全文
posted @ 2013-07-25 10:59 Gifur 阅读(353) 评论(0) 推荐(0) 编辑
摘要:Count the TreesAnother common social inability is known as ACM (Abnormally Compulsive Meditation). This psychological disorder is somewhat common amon... 阅读全文
posted @ 2013-07-22 19:26 Gifur 阅读(840) 评论(0) 推荐(0) 编辑
摘要:【题目链接】http://acm.hdu.edu.cn/showproblem.php?pid=1134【解题背景】这题不会做,自己推公式推了一段时间,将n=3和n=4的情况列出来了,只发现第n项与第n-1项有关系,上网搜索的时候发现是组合数学中关于Catalan(卡特兰)数的运用.以下资料来自网络... 阅读全文
posted @ 2013-07-21 01:32 Gifur 阅读(626) 评论(0) 推荐(1) 编辑
摘要:Crixalis's EquipmentTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2001Accepted Submission(s): 80... 阅读全文
posted @ 2013-07-20 12:55 Gifur 阅读(318) 评论(0) 推荐(0) 编辑
摘要:Problem DescriptionThe famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.The floor ... 阅读全文
posted @ 2013-07-19 15:40 Gifur 阅读(2502) 评论(1) 推荐(1) 编辑
摘要:Wooden SticksTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8899Accepted Submission(s): 3630【解题思路... 阅读全文
posted @ 2013-07-19 08:58 Gifur 阅读(341) 评论(0) 推荐(0) 编辑
摘要:Anagrams by StackTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 870Accepted Submission(s): 419Pro... 阅读全文
posted @ 2013-07-17 19:03 Gifur 阅读(676) 评论(0) 推荐(0) 编辑
摘要:1 #include 2 #include 3 int prime[2600]; 4 void rotprime() 5 { 6 int i, j; 7 memset(prime, 0, sizeof(prime)); 8 prime[0]=prime[1]=1; 9 ... 阅读全文
posted @ 2013-07-16 16:39 Gifur 阅读(233) 评论(0) 推荐(0) 编辑
摘要:Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51449Accepted Submission(s): 13... 阅读全文
posted @ 2013-07-16 09:14 Gifur 阅读(156) 评论(0) 推荐(0) 编辑
摘要:Calling Extraterrestrial Intelligence AgainTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3934Acc... 阅读全文
posted @ 2013-07-16 01:38 Gifur 阅读(189) 评论(0) 推荐(0) 编辑
摘要:17115ooxx numbers时间限制:1000MS 内存限制:65535K题型: 编程题语言: 无限制Descriptiona number A called oo number of a number B if the sum of all As factor is the number B... 阅读全文
posted @ 2013-07-15 14:50 Gifur 阅读(2421) 评论(0) 推荐(0) 编辑
摘要:SubstringsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6004Accepted Submission(s): 2657Problem ... 阅读全文
posted @ 2013-07-15 09:16 Gifur 阅读(222) 评论(0) 推荐(0) 编辑
摘要:10893Spiral时间限制:1000MS 内存限制:65535K题型: 编程题语言: 无限制DescriptionGiven an odd number n, we can arrange integers from 1 to n*n in the shape of a spiral. The ... 阅读全文
posted @ 2013-07-14 22:53 Gifur 阅读(282) 评论(0) 推荐(0) 编辑
摘要:2542Square时间限制:3000MS 内存限制:65536K题型: 外判编程题语言: 无限制DescriptionGiven a set of sticks of various lengths, is it possible to join them end-to-end to form a... 阅读全文
posted @ 2013-07-14 19:31 Gifur 阅读(287) 评论(0) 推荐(0) 编辑
摘要:10690分面包时间限制:1000MS 内存限制:65535K题型: 编程题语言: 无限制Description在大一的时候,XCC还在stu union打酱油~~~~和十三还有奶子他们去外面吃吃喝喝是常有的事。大家都知道空腹喝酒是有害肚子滴,所以呢,要买一些面包来下酒。不过我们有个习惯,就是所有的... 阅读全文
posted @ 2013-07-14 01:22 Gifur 阅读(662) 评论(0) 推荐(0) 编辑
摘要:10678神奇的异或时间限制:1000MS 内存限制:65535K题型: 编程题语言: 无限制Description 在现在这个信息时代,数据是很重要的东西哦~ 很多时候,一条关键的数据(情报、信息)是可以价值千金的。所以,现代也出现了很多数据校验技术来确保数据的正确性。 以下是一... 阅读全文
posted @ 2013-07-13 19:05 Gifur 阅读(638) 评论(0) 推荐(0) 编辑
摘要:9509开灯时间限制:1000MS 内存限制:65535K题型: 编程题语言: 无限制Description有16的开关分别控制16盏灯,开关排列成4*4的矩形,这些开关有这样的关系:你改变其中一个开关的状态,与其同行和同列的开关的状态也跟着改变。先给出一个这些开关的初始状态,要求将所有的开关都打开... 阅读全文
posted @ 2013-07-13 14:16 Gifur 阅读(615) 评论(0) 推荐(0) 编辑
摘要:【题目链接】http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=144【随笔侃述】这题感想多过于解题的思路,TL不可避免,很难想象1Y过的... 阅读全文
posted @ 2013-07-13 00:55 Gifur 阅读(441) 评论(0) 推荐(0) 编辑
摘要:DescriptionThe 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding... 阅读全文
posted @ 2013-07-12 19:54 Gifur 阅读(438) 评论(0) 推荐(0) 编辑
摘要:10317Fans of Footbal Teams时间限制:1000MS 内存限制:65535K题型: 编程题语言: 无限制DescriptionTwo famous football teams, named AC Milan(AC米兰) and Inter Milan(国际米兰) will h... 阅读全文
posted @ 2013-07-12 15:44 Gifur 阅读(416) 评论(0) 推荐(0) 编辑
摘要:Sticks【题目链接】:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=243【 随 笔 】:很久之前就遇到这道题,题目意思容易理解... 阅读全文
posted @ 2013-07-11 01:06 Gifur 阅读(481) 评论(0) 推荐(0) 编辑
摘要:Problem DDancing Digits题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=112&page=show_problem&problem=2139题目意思:给你{1,... 阅读全文
posted @ 2013-07-03 08:56 Gifur 阅读(410) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1043解题背景:看到八数码问题,没有任何的想法,偶然在翻看以前做的题的时候发现解决过类似的一道题,不过那题是求最长的移动步骤,给你的时间有10s之多,用set和queue过了它,这题我套用当时的模板,具体... 阅读全文
posted @ 2013-07-02 16:38 Gifur 阅读(1025) 评论(0) 推荐(0) 编辑
摘要:EquationsTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3978Accepted Submission(s): 1602Problem D... 阅读全文
posted @ 2013-07-01 15:25 Gifur 阅读(592) 评论(0) 推荐(0) 编辑

TOP
点击右上角即可分享
微信分享提示