08 2012 档案

HDU 1531 King（差分约束）
摘要：KingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 601Accepted Submission(s): 287Problem DescriptionOnce, in one kingdom, there was a queen and that queen was expecting a baby. The queen prayed: ``If my child was a son and if only he was a sound . 阅读全文
posted @ 2012-08-29 09:56 Suhx 阅读(571) 评论(0) 推荐(0)
HDU 2602 Bone Collector（01背包）
摘要：Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14336Accepted Submission(s): 5688Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such. 阅读全文
posted @ 2012-08-28 10:46 Suhx 阅读(6793) 评论(1) 推荐(3)
HDU 1166 敌兵布阵（线段树区间求和）
摘要：敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19445Accepted Submission(s): 8481Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人. 阅读全文
posted @ 2012-08-28 10:00 Suhx 阅读(358) 评论(0) 推荐(0)
HDU 1754 I Hate It（线段树区间求最值）
摘要：I Hate ItTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18466Accepted Submission(s): 7172Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。这让很多学生很反感。不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师的询问。当然，老师有时候需要更新某位同学的成绩。Input本题目包含多组测试，请处理到文件结束。在每. 阅读全文
posted @ 2012-08-27 22:20 Suhx 阅读(4275) 评论(0) 推荐(0)
HDU 1548 A strange lift（Dijkstra、BFS、DP）
摘要：A strange liftTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6706Accepted Submission(s): 2499Problem DescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.T 阅读全文
posted @ 2012-08-27 21:49 Suhx 阅读(2165) 评论(1) 推荐(0)
HDU 1042 N!（高精度计算阶乘）
摘要：N!Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34687Accepted Submission(s): 9711Problem DescriptionGiven an integer N(0 ≤ N ≤ 10000), your task is to calculate N!InputOne N in one line, process to the end of file.OutputFor each N, output N! in. 阅读全文
posted @ 2012-08-27 21:25 Suhx 阅读(6793) 评论(0) 推荐(1)
HDU 2138 How many prime numbers（米勒拉宾素数测试算法）
摘要：How many prime numbersTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7120Accepted Submission(s): 2375Problem DescriptionGive you a lot of positive integers, just to find out how many prime numbers there are.InputThere are a lot of cases. In each . 阅读全文
posted @ 2012-08-27 20:57 Suhx 阅读(2809) 评论(0) 推荐(1)
HDU 1527 取石子游戏（威佐夫博奕）
摘要：取石子游戏Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2039Accepted Submission(s): 965Problem Description有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目，如果轮到你先取，假设双方都采取最好的策略，问最后你是胜者还. 阅读全文
posted @ 2012-08-26 22:12 Suhx 阅读(532) 评论(0) 推荐(0)
HDU 2516 取石子游戏（斐波那契博弈）
摘要：取石子游戏Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1415Accepted Submission(s): 798Problem Description1堆石子有n个,两人轮流取.先取者第1次可以取任意多个，但不能全部取完.以后每次取的石子数不能超过上次取子数的2倍。取完者胜.先取者负输出"Second win".先取者胜输出"First win".Input输入有多组.每组第1行是2<=n& 阅读全文
posted @ 2012-08-26 21:08 Suhx 阅读(2857) 评论(1) 推荐(1)
巴什博弈、威佐夫博弈、尼姆博弈
摘要：（转）取石子问题综述有一种很有意思的游戏，就是有物体若干堆，两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，这游戏虽极其简单，却蕴含着深刻的数学原理。（一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个。最后取光者得胜。 显然，如果n=m+1，那么由于一次最多只能取m个，所以，无论先取者拿走多少个，后取者都能够一次拿走剩余的物品，后者取胜。因此我们发现了如何取胜的法则：如果n=（m+1）r+s，（r为任意自然数，s≤m),那么先取者要拿走s个物品，如果后取者拿走k（≤m)个，那么先取者再拿走m+1- 阅读全文
posted @ 2012-08-26 20:57 Suhx 阅读(454) 评论(0) 推荐(0)
HDU 1431 素数回文（高效判断素数法）
摘要：素数回文Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6234Accepted Submission(s): 1421Problem Descriptionxiaoou33对既是素数又是回文的数特别感兴趣。比如说151既是素数又是个回文。现在xiaoou333想要你帮助他找出某个范围内的素数回文数，请你写个程序找出 a 跟b 之间满足条件的数。(5 <= a < b <= 100,000,000); Input这里有许多组数 阅读全文
posted @ 2012-08-26 16:34 Suhx 阅读(4994) 评论(0) 推荐(0)
HDU 1998 奇数阶魔方
摘要：奇数阶魔方Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1283Accepted Submission(s): 716Problem Description一个 n 阶方阵的元素是1,2,...,n^2,它的每行，每列和2条对角线上元素的和相等，这样的方阵叫魔方。n为奇数时我们有1种构造方法，叫做“右上方” ，例如下面给出n=3，5，7时的魔方.38 1 63 5 74 9 2517 24 1 8 1523 5 7 14 164 6 13 . 阅读全文
posted @ 2012-08-24 21:44 Suhx 阅读(539) 评论(1) 推荐(0)
HDU 2136 Largest prime factor（筛选法）
摘要：Largest prime factorTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4026Accepted Submission(s): 1415Problem DescriptionEverybody knows any number can be combined by the prime number.Now, your task is telling me what position of the largest prime f. 阅读全文
posted @ 2012-08-24 21:05 Suhx 阅读(2122) 评论(0) 推荐(1)
HDU 1215 七夕节（筛选法）
摘要：七夕节Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18945Accepted Submission(s): 5697Problem Description七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:"你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!"人们纷纷来到告示前,都想知道谁才是自己的另一半.告示如下:数字N的因子就是所有比N小又能被N整除的所有正整数,如12的因子有1,2 阅读全文
posted @ 2012-08-24 17:23 Suhx 阅读(386) 评论(0) 推荐(0)
HDU 1856 Brave Game（巴什博奕）
摘要：Brave GameTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3175Accepted Submission(s): 2105Problem Description十年前读大学的时候，中国每年都要从国外引进一些电影大片，其中有一部电影就叫《勇敢者的游戏》（英文名称：Zathura），一直到现在，我依然对于电影中的部分电脑特技印象深刻。今天，大家选择上机考试，就是一种勇敢（brave）的选择；这个短学期，我们讲的是博弈（game）专题；所. 阅读全文
posted @ 2012-08-24 15:49 Suhx 阅读(1537) 评论(0) 推荐(0)
HDU 2183 奇数阶魔方(II)
摘要：奇数阶魔方(II)Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 291Accepted Submission(s): 171Problem Description1 ，2， 3， …，n^2 这n^2 个数 排成n*n 方阵 每行每列每条对角线上的n个数字之和s相等， s=n（n*n+1）/2,奇数阶魔方可由菱形转变成 n=3,5时如下 3 *********1 ******4******2 ***7*****5******3 ******. 阅读全文
posted @ 2012-08-23 19:55 Suhx 阅读(286) 评论(0) 推荐(0)
HDU 4165 Pills（DP/记忆化搜索/卡塔兰数）
摘要：PillsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 569Accepted Submission(s): 373Problem DescriptionAunt Lizzie takes half a pill of a certain medicine every day. She starts with a bottle that contains N pills.On the first day, she removes a ran. 阅读全文
posted @ 2012-08-22 21:35 Suhx 阅读(1325) 评论(0) 推荐(0)
HDU 2059 龟兔赛跑（DP）
摘要：龟兔赛跑Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6978Accepted Submission(s): 2667Problem Description据说在很久很久以前，可怜的兔子经历了人生中最大的打击——赛跑输给乌龟后，心中郁闷，发誓要报仇雪恨，于是躲进了杭州下沙某农业园卧薪尝胆潜心修炼，终于练成了绝技，能够毫不休息得以恒定的速度(VR m/s)一直跑。兔子一直想找机会好好得教训一下乌龟，以雪前耻。最近正值HDU举办50周年校庆，社. 阅读全文
posted @ 2012-08-22 19:56 Suhx 阅读(2577) 评论(0) 推荐(1)
HDU 1331 Function Run Fun（记忆化搜索）
摘要：Function Run FunTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1387Accepted Submission(s): 709Problem DescriptionWe all love recursion! Don't we?Consider a three-parameter recursive function w(a, b, c):if a <= 0 or b <= 0 or c <= 0, t 阅读全文
posted @ 2012-08-20 20:30 Suhx 阅读(1052) 评论(0) 推荐(0)
HDU 1059 Dividing（多重背包）
摘要：DividingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9533Accepted Submission(s): 2596Problem DescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the m. 阅读全文
posted @ 2012-08-20 16:03 Suhx 阅读(322) 评论(0) 推荐(0)
HDU 1124 Factorial（简单数论）
摘要：FactorialTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1741Accepted Submission(s): 1114Problem DescriptionThe most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this . 阅读全文
posted @ 2012-08-19 21:13 Suhx 阅读(189) 评论(0) 推荐(0)
HDU 2844 Coins（多重背包+二进制优化）
摘要：CoinsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3424Accepted Submission(s): 1345Problem DescriptionWhuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He de. 阅读全文
posted @ 2012-08-19 17:25 Suhx 阅读(258) 评论(0) 推荐(0)
HDU 2159 FATE（二维费用完全背包）
摘要：FATETime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3905Accepted Submission(s): 1718Problem Description最近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感，但又不得不通过杀怪来升完这最后一级。现在的问题是，xhd升掉最后一级还需n的经验值，xhd还留有m的忍耐度，每杀一个怪xhd会得到相应的经验，并减掉相应的忍耐度。当忍. 阅读全文
posted @ 2012-08-19 11:12 Suhx 阅读(250) 评论(0) 推荐(0)
HDU 2955 Robberies（01背包的概率问题）
摘要：RobberiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4953Accepted Submission(s): 1878Problem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because th. 阅读全文
posted @ 2012-08-18 17:20 Suhx 阅读(324) 评论(0) 推荐(0)
HDU 1203 I NEED A OFFER!（01背包）
摘要：I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9932Accepted Submission(s): 3687Problem DescriptionSpeakless很早就想出国，现在他已经考完了所有需要的考试，准备了所有要准备的材料，于是，便需要去申请学校了。要申请国外的任何大学，你都要交纳一定的申请费用，这可是很惊人的。Speakless没有多少钱，总共只攒了n万美元。他将在m个学校中选择若干的（当然要在他. 阅读全文
posted @ 2012-08-17 22:09 Suhx 阅读(2326) 评论(0) 推荐(1)
POJ 1273 Drainage Ditches（最大流）
摘要：网上找到的一份比较好的关于网络流最大流的资料，学习下...图-1 如图-1所示，在这个运输网络中，源点S和汇点T分别是1,7，各边的容量为C(u,v)。图中红色虚线所示就是一个可行流。标准图示法如图-2所示： 其中p(u,v) / c(u,v)分别表示该边的实际流量与最大容量。 关于最大流 熟悉了什么是网络流，最大流也就很好理解了。就是对于任意的u∈V-{s},使得p(s,u)的和达到最大。上面的运输网络中，最大流如图-3所示：MaxFlow=p(1,2)+p(1,3)=2+1=3。 在介绍最大流问题之前，先介绍几个概念：残余网络，增广路径，反向弧，最大流定理以及求最大流的Ford-F... 阅读全文
posted @ 2012-08-16 22:47 Suhx 阅读(376) 评论(0) 推荐(0)
HDU 3177 Crixalis's Equipment（差排）
摘要：Crixalis's EquipmentTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1429Accepted Submission(s): 583Problem DescriptionCrixalis - Sand King used to be a giant scorpion(蝎子) in the deserts of Kalimdor. Though he's a guardian of Lich King now, 阅读全文
posted @ 2012-08-15 20:21 Suhx 阅读(415) 评论(0) 推荐(0)
HDU 3172 Virtual Friends（并查集）
摘要：Virtual FriendsTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1629Accepted Submission(s): 472Problem DescriptionThese days, you can do all sorts of things online. For example, you can use various websites to make virtual friends. For some people,. 阅读全文
posted @ 2012-08-15 20:13 Suhx 阅读(1281) 评论(1) 推荐(1)
HDU 4185 Oil Skimming（匈牙利）
摘要：二分图最大匹配问题之匈牙利算法一：匈牙利算法的原理：从当前的匹配M(如果木有匹配，则取初始化匹配M为空集)出发，检查每一个未盖点，然后从它出发寻找可增广路，找到可增广路，则沿着这条可增广路进行扩充，直到不存在可增广路为止。二：根据从未盖点出发寻找可增广路搜索的方法，可以分成：1.DFS增广2.BFS增广3.多增广（Hopcroft-Karp算法）采用DFS思想搜索可增广路并求出最大匹配的代码如下：#define MAX 101//MAX为表示X集合和Y集合顶点个数最大值的符号常量int vis[MAX] ;//记录顶点访问状态的数组，为1时表示已经访问过，为0时表示未被访问过int nx,ny 阅读全文
posted @ 2012-08-14 22:44 Suhx 阅读(689) 评论(0) 推荐(0)
HDU 1251 统计难题（字典树）
摘要：非常经典的字典树问题 统计难题Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 10514Accepted Submission(s): 4328Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师 阅读全文
posted @ 2012-08-14 22:10 Suhx 阅读(282) 评论(0) 推荐(0)
HDU 3549 Flow Problem（最大流最短路径增广）
摘要：Flow ProblemTime Limit: 5000/5000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 3301Accepted Submission(s): 1552Problem DescriptionNetwork flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted dir. 阅读全文
posted @ 2012-08-14 21:09 Suhx 阅读(274) 评论(0) 推荐(0)
HDU 1532 Drainage Ditches（最大流）
摘要：最大流的三种模板以HDU 1532 Drainage Ditches为例 Drainage DitchesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4501Accepted Submission(s): 2099Problem DescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover 阅读全文
posted @ 2012-08-14 20:47 Suhx 阅读(187) 评论(0) 推荐(0)