ACM（HOJ）题目解题报告 - 随笔分类(第9页) - kuangbin

HDU 3534 Tree （树形DP）

摘要：题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3534题意：给出一颗树（n个顶点，n-1条边）求最长的路径，以及最长路径的条数。路径无非就是连接两个点直接的路。因为是一颗树，所以连接两个点肯定是唯一的路径。其实就是求两点间距离的最大值，以及这个最大值有多少个。很裸的树形DP；首先统计出结点到叶子结点的最长距离和次长距离。然后找寻经过这个点的，在这个为根结点的子树中的最长路径个数目。代码：#include <string.h>#include <iostream>#include <algorithm>#incl 阅读全文

posted @ 2013-05-29 00:15 kuangbin 阅读(716) 评论(0) 推荐(0)

2013金山西山居创意游戏程序挑战赛——复赛（1） HDU 4557 非诚勿扰 HDU 4558 剑侠情缘 HDU 4559 涂色游戏 HDU 4560 我是歌手

摘要：今天的比赛。。。。。速度还是慢了。。。无缘无故错误提交好多次。。哭了。。。。比较简单：A题：HDU 4557非诚勿扰链接：http://acm.hdu.edu.cn/showproblem.php?pid=4557暴力胡搞，水题：//============================================================================// Name : A.cpp// Author : // Version :// Copyright : Your copyright notice// Description... 阅读全文

posted @ 2013-05-24 22:12 kuangbin 阅读(1615) 评论(3) 推荐(0)

HDU 4549 M斐波那契数列（矩阵快速幂+欧拉定理）

摘要：M斐波那契数列Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 353Accepted Submission(s): 93Problem DescriptionM斐波那契数列F[n]是一种整数数列，它的定义如下：F[0] = aF[1] = bF[n] = F[n-1] * F[n-2] ( n > 1 )现在给出a, b, n，你能求出F[n]的值吗？Input输入包含多组测试数据；每组数据占一行，包含3个整数a, b, n（ 0 < 阅读全文

posted @ 2013-05-21 15:11 kuangbin 阅读(3226) 评论(5) 推荐(1)

HDU 4550 卡片游戏（贪心）

摘要：卡片游戏Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 376Accepted Submission(s): 115Problem Description 小明最近宅在家里无聊，于是他发明了一种有趣的游戏，游戏道具是N张叠在一起的卡片，每张卡片上都有一个数字，数字的范围是0~9，游戏规则如下：首先取最上方的卡片放到桌子上，然后每次取最上方的卡片，放到桌子上已有卡片序列的最右边或者最左边。当N张卡片全部都放到桌子上后，桌子上的N张卡片构成了.. 阅读全文

posted @ 2013-05-21 00:59 kuangbin 阅读(1569) 评论(0) 推荐(0)

HDU 4551 生日猜猜猜（简单题）

摘要：生日猜猜猜Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 460Accepted Submission(s): 176Problem Description小明对生日十分看重，因为他可以得到祝福，可以和朋友亲人一起分享快乐，可以为自己的人生做一次总结，并且...能够收到好多礼物！不过小明是个神秘的人，不会轻易告诉你他的生日，现在他想到一个办法，让你去猜他的生日是哪一天。小明会告诉你如下三个信息：1. 出生月份和出生日子的最大公约数；2. 出生月阅读全文

posted @ 2013-05-20 19:23 kuangbin 阅读(862) 评论(0) 推荐(0)

HDU 4552 怪盗基德的挑战书（后缀数组）

摘要：怪盗基德的挑战书Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 345Accepted Submission(s): 163Problem Description “在树最美丽的那天，当时间老人再次把大钟平均分开时，我会降临在灯火之城的金字塔前，带走那最珍贵的笑容。”这是怪盗基德盗取巴黎卢浮宫的《蒙娜丽莎的微笑》这幅画时，挑战书上的内容。但这次，怪盗基德的挑战书上出现了一串串小写字母“aaab sdfeeddd...”。柯南以小学生的眼睛.. 阅读全文

posted @ 2013-05-20 19:22 kuangbin 阅读(1626) 评论(2) 推荐(0)

HDU 4553 约会安排（线段树，区间合并）

摘要：约会安排Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 147Accepted Submission(s): 47Problem Description 寒假来了，又到了小明和女神们约会的季节。小明虽为屌丝级码农，但非常活跃，女神们常常在小明网上的大段发言后热情回复“呵呵”，所以，小明的最爱就是和女神们约会。与此同时，也有很多基友找他开黑，由于数量实在过于巨大，怎么安排时间便成了小明的一大心事。我们已知小明一共有T的空闲时间，期间会有... 阅读全文

posted @ 2013-05-20 18:29 kuangbin 阅读(1844) 评论(0) 推荐(1)

HDU 4547 CD操作（LCA）

摘要：CD操作Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 78Accepted Submission(s): 14Problem Description 在Windows下我们可以通过cmd运行DOS的部分功能，其中CD是一条很有意思的命令，通过CD操作，我们可以改变当前目录。这里我们简化一下问题，假设只有一个根目录，CD操作也只有两种方式： 1. CD 当前目录名\...\目标目录名 (中间可以包含若干目录，保证目标目录通过绝对路... 阅读全文

posted @ 2013-05-17 21:37 kuangbin 阅读(1138) 评论(0) 推荐(0)

HDU 4546 比赛难度

摘要：比赛难度Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 46Accepted Submission(s): 6Problem Description 最近，小明出了一些ACM编程题，决定在HDOJ举行一场公开赛。假设题目的数量一共是n道，这些题目的难度被评级为一个不超过1000的非负整数，并且一场比赛至少需要一个题，而这场比赛的难度，就是所有题目的难度之和，同时，我们认为一场比赛与本场题目的顺序无关，而且题目也不会重复。显而易见，很容... 阅读全文

posted @ 2013-05-17 21:33 kuangbin 阅读(613) 评论(3) 推荐(0)

HDU 4545 魔法串（简单DP）

摘要：魔法串Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 70Accepted Submission(s): 37Problem Description 小明和他的好朋友小西在玩一个新的游戏，由小西给出一个由小写字母构成的字符串，小明给出另一个比小西更长的字符串，也由小写字母组成，如果能通过魔法转换使小明的串和小西的变成同一个，那么他们两个人都会很开心。这里魔法指的是小明的串可以任意删掉某个字符，或者把某些字符对照字符变化表变化。如：小西... 阅读全文

posted @ 2013-05-17 21:26 kuangbin 阅读(888) 评论(0) 推荐(0)

HDU 2829 Lawrence （斜率DP）

摘要：LawrenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1523Accepted Submission(s): 671Problem DescriptionT. E. Lawrence was a controversial figure during World War I. He was a British officer who served in the Arabian theater and led a group of Ar 阅读全文

posted @ 2013-05-08 22:38 kuangbin 阅读(934) 评论(0) 推荐(0)

HDU 3530 Subsequence（单调队列）

摘要：SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3266Accepted Submission(s): 1063Problem DescriptionThere is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference betwe 阅读全文

posted @ 2013-05-08 00:04 kuangbin 阅读(972) 评论(0) 推荐(0)

HDU 3032 Nim or not Nim?（博弈，打表找规律）

摘要：Nim or not Nim?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 540Accepted Submission(s): 246Problem DescriptionNim is a two-player mathematic game of strategy in which players take turns removing objects from distinct heaps. On each turn, a player 阅读全文

posted @ 2013-05-04 21:12 kuangbin 阅读(484) 评论(0) 推荐(0)

HDU 1525 Euclid's Game（博弈）

摘要：Euclid's GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1116Accepted Submission(s): 516Problem DescriptionTwo players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtracts any positive multiple of the 阅读全文

posted @ 2013-05-04 19:07 kuangbin 阅读(549) 评论(0) 推荐(0)

HDU 3416 Marriage Match IV（SPFA+最大流）

摘要：Marriage Match IVTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1514Accepted Submission(s): 427Problem DescriptionDo not sincere non-interference。Like that show, now starvae also take part in a show, but it take place between city A and B. Starvae 阅读全文

posted @ 2013-05-04 13:00 kuangbin 阅读(1613) 评论(0) 推荐(0)

HDU 3277 Marriage Match III（最大流+二分+并查集）

摘要：Marriage Match IIITime Limit: 10000/4000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 771Accepted Submission(s): 236Problem DescriptionPresumably, you all have known the question of stable marriage match. A girl will choose a boy; it is similar as the ever game of pl 阅读全文

posted @ 2013-05-04 00:03 kuangbin 阅读(539) 评论(0) 推荐(0)

HDU 3081 Marriage Match II （最大流+二分+并查集）

摘要：Marriage Match IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1085Accepted Submission(s): 388Problem DescriptionPresumably, you all have known the question of stable marriage match. A girl will choose a boy; it is similar as the game of playing 阅读全文

posted @ 2013-05-03 23:35 kuangbin 阅读(651) 评论(0) 推荐(0)

HDU 3605 Escape（最大流）

摘要：EscapeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2523Accepted Submission(s): 691Problem Description2012 If this is the end of the world how to do? I do not know how. But now scientists have found that some stars, who can live, but some people 阅读全文

posted @ 2013-05-03 14:55 kuangbin 阅读(1222) 评论(1) 推荐(0)

HDU 2883 kebab （最大流）

摘要：kebabTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 489Accepted Submission(s): 211Problem DescriptionAlmost everyone likes kebabs nowadays (Here a kebab means pieces of meat grilled on a long thin stick). Have you, however, considered about the ha 阅读全文

posted @ 2013-05-03 12:44 kuangbin 阅读(661) 评论(0) 推荐(0)

HDU 3338 Kakuro Extension（最大流）

摘要：Kakuro ExtensionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 590Accepted Submission(s): 204Special JudgeProblem DescriptionIf you solved problem likethis, forget it.Because you need to use a completely different algorithm to solve the following 阅读全文

posted @ 2013-05-02 22:52 kuangbin 阅读(746) 评论(0) 推荐(0)

随笔分类 - ACM（HOJ）题目解题报告