Inkbamboo专栏

转载自:http://blog.youkuaiyun.com/wconvey/article/details/7460909HDU上的专题训练（背包问题-线段树+树状数组+DP优化+网络流+字符匹配+最短路+矩阵乘法+搜索专题++）就是DIY上的专题训练【背包问题】2602 Bone Collector     1114 Piggy-Bank

转载自：http://blog.youkuaiyun.com/wuhuajunbao/article/details/38454175Who's the boss?Time Limit: 5000MS Memory Limit: 30000KTotal Submissions: 2626 Accepted: 1078Descr

Matrix Chain MultiplicationTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2095 Accepted: 1327DescriptionSuppose you have to evaluate an expression like

BabelfishTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 34681 Accepted: 14869DescriptionYou have just moved from Waterloo to a big city. The people her

排列Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 17145 Accepted: 6860Description题目描述： 大家知道，给出正整数n，则1到n这n个数可以构成n！种排列，把这些排列按照从小到大的顺序（字典顺序）列出，如n=3时，列出1

Binary Tree Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 4   Accepted Submission(s) : 3Problem DescriptionBackgroundBinary trees are

Tree Recovery Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 4   Accepted Submission(s) : 4Problem DescriptionLittle Valentine liked pla

tim给你一颗苹果树，树的主干设为1，每一个分支设为一个数，一直到N，代表这颗苹果树。每个分支上面只能最多有一个苹果，也就是一个枝子上面不可能有两个苹果，另外注意一点，不要把苹果树想象成二叉树，苹果树每个节点可以分出很多叉，应该是多叉树。 输入是叉之间的关系，1 21 3就是主干上面两个叉分别是2 和3. 下面是两种操作，Q 和C

StarsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5142    Accepted Submission(s): 2021Problem DescriptionAstronomers often examin

LA4329 Ping pong（树状数组与组合原理）N (3N20000)ping pong players live along a west-east street(consider the street as a line segment). Each player has a unique skill rank. To improve their skill

转载自他人的代码：tarjan

转载自:http://blog.youkuaiyun.com/vinci_lau/article/details/7079005JosephDescriptionThe Joseph's problem is notoriously known. For those  who are not familiar with the original problem: from among n

分类：             文摘              2012-11-07 19:24     1048人阅读     评论(0)    收藏    举报    ACM 所有算法数据结构栈，队列，链表哈希表，哈希数组堆，优先队列双端队列可并堆左偏堆二叉查找树Treap伸展树

WatchcowTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 6250 Accepted: 2704 Special JudgeDescriptionBessie's been appointed the new watch-cow for th

Children's DiningTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4263 Accepted: 582 Special JudgeDescriptionUsually children in kindergarten like

http://acm.hdu.edu.cn/showproblem.php?pid=4081我就不说题意了，为了使A/B最大，就应该是B越小，故可以先求出n个点的最小生成树。因此，可以枚举每一条边，假设最小生成树的值是B, 而枚举的那条边长度是edge[i][j],  如果这一条边已经是属于最小生成树上的，那么最终式子的值是A/(B-edge[i][j])。如果这一条不属于最小生成树上的，

转载自：http://www.cnblogs.com/void/articles/2048209.html有N(N给出N,M和M个欢迎关系，求被所有牛都欢迎的牛的数量。用强联通分量做，求连通分量我用的是Kosaraju算法。首先求出联通分量的个数，然后依次求各个联通分量的出度，如果仅有一个连通分量出度为0则这个联通分量内的点的个数就是答案；如果有多于一个的联通分

转载自：http://blog.youkuaiyun.com/wangjian8006/article/details/7888558想看更多的解题报告: http://blog.youkuaiyun.com/wangjian8006/article/details/7870410                             题目大意：有N个学校，从每个学校都能从一个单向网络到另外一个

Vertical HistogramTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17789 Accepted: 8599DescriptionWrite a program to read four lines of upper case (i.e.,

寻找丑数（Ugly Number）2010-10-29我们把只包含因子2、3和5的数称作丑数（Ugly Number）。例如6、8都是丑数，但14不是，因为它包含因子7。习惯上我们把1当做是第一个丑数。求按从小到大的顺序的第1500个丑数下面是一道在网络上广为流传的面试题，据说google曾经采用过这道题。所谓一个数m是另一个数n的因子，是指n能被m整除，也就是n % m

钱币兑换问题http://acm.hdu.edu.cn/showproblem.php?pid=1284Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K(Java/Others)Total Submission(s): 3261 Accepted Submission(s):1842Pr

中国国家集训队论文集目录(1999-2008)    国家集训队1999论文集陈宏：《数据结构的选择与算法效率——从IOI98试题PICTURE谈起》来煜坤：《把握本质，灵活运用——动态规划的深入探讨》齐鑫：《搜索方法中的剪枝优化》邵铮：《数学模型的建立、比较和应用》石润婷：《隐蔽化、多维化、开放化——论当今信息学竞赛中数学建模的灵活性》杨帆：《准确性、

Cube StackingTime Limit : 4000/2000ms (Java/Other)   Memory Limit : 60000/30000K (Java/Other)Total Submission(s) : 10   Accepted Submission(s) : 4Problem DescriptionFarmer John and Betsy are p

Marbles on a tree Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 60000/30000K (Java/Other)Total Submission(s) : 4   Accepted Submission(s) : 3Problem Descriptionn boxes are placed on t

HDOJ 1518 Square（DFS 深搜）分类： 深搜2012-09-05 20:29 841人阅读 评论(0) 收藏 举报integeroutputeachinputjoinim题目SquareTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Jav

变形课Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 7   Accepted Submission(s) : 4Problem Description呃......变形课上Harry碰到了一点小麻烦,因为他并

Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions:22644 Accepted: 7943DescriptionA Bank plans to install a machine for cash withdrawal. T

Charm BraceletTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 7   Accepted Submission(s) : 3Problem DescriptionBessie has gon

Common Subsequence Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 12   Accepted Submission(s) : 6Problem DescriptionA subsequence of a gi

最少拦截系统Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 62   Accepted Submission(s) : 21Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统

CoinsTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 30   Accepted Submission(s) : 13Problem DescriptionWhuacmers use coins.They h

Cash MachineTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 16   Accepted Submission(s) : 9Problem DescriptionA Bank plans to inst

Piggy-BankTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 11   Accepted Submission(s) : 8Problem DescriptionBefore ACM can do anyt

变形课Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 14   Accepted Submission(s) : 8Problem Description呃......变形课上Harry碰到了一点小麻烦,因为他

Goldbach's ConjectureTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 6   Accepted Submission(s) : 4Problem DescriptionIn 1742, Ch

DescriptionThe most important part of a GSM network is so called Base Transceiver Station (BTS). These transceivers form the areas called cells (this term gave the name to the cellular phone) and

Problem Description某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不好，每次要从一个城镇到另一个城镇时，都有许多种道路方案可以选择，而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。 现在，已知起点和终点，请你计算出要从起点到终点，最短需要行走多少距离。 Input本题目包含多组数据，请处理到文件结束。 每组数据

Problem ATime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 30   Accepted Submission(s) : 13Problem Description上次Gardon的迷宫城堡小希玩了很久（见P

Problem CTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 40000/20000K (Java/Other)Total Submission(s) : 17   Accepted Submission(s) : 11Problem DescriptionSevere acute respirato

转载自http://blog.youkuaiyun.com/mad_lpx/article/details/7427008Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20136 Accepted: 5963