2016年08月_Wang_SF2015

原创文章标题 poj 1008:玛雅历（模拟）

玛雅历Description上周末，M.A. Ya教授对古老的玛雅有了一个重大发现。从一个古老的节绳（玛雅人用于记事的工具）中，教授发现玛雅人使用了一个一年有365天的叫做Haab的历法。这个Haab历法拥有19个月，在开始的18个月，一个月有20天，月份的名字分别是pop, no, zip, zotz, tzec, xul, yoxkin, mol, chen, yax, zac, ceh, ma

2016-08-31 00:19:16 1143

原创文章标题 POJ 2349：Arctic Network （最小生成树Kruskal算法+并查集）

Arctic NetworkDescriptionThe Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establish

2016-08-18 16:17:25 512

原创文章标题 codeforces 115A:Party ( 并查集）

PartyDescriptionA company has n employees numbered from 1 to n. Each employee either has no immediate manager or exactly one immediate manager, who is another employee with a different number. An emplo

2016-08-18 15:50:20 359

原创文章标题 HDU 1176：免费馅饼（DP）

免费馅饼题意：就是在0~10的坐标上，每一秒都有馅饼掉在这上面，然后，现在有一个人在5的位置上，每次他只能移动一个，比如他在5 位置，下一秒他可以跑到4 5 6其中一个上面，现在就是要求当馅饼掉完之后，他最多能接到多少馅饼。分析：这是一道动态规划的问题，定义dp[i,j]表示为在第i秒时在j位置最多能那到的馅饼的数量。输入时用一个数组num[i,j]保存第i秒在j 位置上馅饼的数量，所以就可以得

2016-08-18 15:11:38 320

原创文章标题 HDU 5272:Dylans loves numbers( 水）

Dylans loves numbersDescriptionWho is Dylans?You can find his ID in UOJ and Codeforces. His another ID is s1451900 in BestCoder. And now today’s problems are all about him. Dylans is given a number N

2016-08-18 14:40:10 390

原创文章标题 codeforces 706B :Interesting drink( 水）

Interesting drinkDescriptionVasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink “Beecola”, which can be bought in n d

2016-08-15 08:54:50 178

原创文章标题 codeforces 701B:Cells Not Under Attack(水+set)

Cells Not Under AttackDescriptionVasya has the square chessboard of size n × n and m rooks. Initially the chessboard is empty. Vasya will consequently put the rooks on the board one after another.The c

2016-08-09 19:31:32 168

原创文章标题 HDU 5584：LCM Walk（数学推导）

LCM WalkDescriptionA frog has just learned some number theory, and can’t wait to show his ability to his girlfriend. Now the frog is sitting on a grid map of infinite rows and columns. Rows are numbere

2016-08-09 19:16:35 311

原创文章标题 HDU 1800：Flying to the Mars（字典树）

Flying to the MarsDescriptionIn the year 8888, the Earth is ruled by the PPF Empire . As the population growing , PPF needs to find more land for the newborns . Finally , PPF decides to attack Kscinow

2016-08-09 08:36:20 384

原创文章标题 HDU 5583：Kingdom of Black and White（暴力+代码实现能力）

Kingdom of Black and WhiteDescriptionIn the Kingdom of Black and White (KBW), there are two kinds of frogs: black frog and white frog. Now frogs are standing in a line, some of them are black, the oth

2016-08-08 08:51:34 486

原创文章标题 HDU 1841:Find the Shortest Common Superstring(KMP)

Find the Shortest Common SuperstringDescriptionThe shortest common superstring of 2 strings S 1 and S 2 is a string S with the minimum number of characters which contains both S 1 and S 2 as a sequence

2016-08-05 20:22:05 384

原创文章标题 POj 1321：棋盘问题（DFS）

棋盘问题Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。 Input输入含有多组测试数据。每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n <= 8 ,

2016-08-04 08:51:46 389

原创文章标题 codeforces 75C:Modified GCD (二分+最大公因数）

Modified GCDDescriptionWell, here is another math class task. In mathematics, GCD is the greatest common divisor, and it’s an easy task to calculate the GCD between two positive integers.A common divis

2016-08-02 19:48:05 661

原创文章标题 codeforces 598F :Gourmet and Banquet(贪心+二分）

DescriptionA gourmet came into the banquet hall, where the cooks suggested n dishes for guests. The gourmet knows the schedule: when each of the dishes will be served.For i-th of the dishes he knows tw

2016-08-02 19:33:12 587

原创文章标题 HDU 3853：LOOPS (概率DP）

LoopsDescriptionAkemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl). Homura wants to help her friend Madoka save the world. But because of the plot of the Boss Incubator, she is trapped in a laby

2016-08-01 20:28:42 385

原创 HDU 4405：Aeroplane chess（概率DP）

Aeroplane chessDescriptionHzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws a dice(a dice have six faces

2016-08-01 08:57:45 304

Wang_SF2015的博客