martinue

用脑袋解决一切= =

hdu1003(简单dp)

Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,...

2015-08-30 19:20:20

阅读数:430

评论数:0

hdu1559(最大子矩阵)

Problem Description 给你一个m×n的整数矩阵,在上面找一个x×y的子矩阵,使子矩阵中所有元素的和最大。   Input 输入数据的第一行为一个正整数T,表示有T组测试数据。每一组测试数据的第一行为四个正整数m,n,x,y(0   Output 对于每组数据,输...

2015-08-30 18:41:23

阅读数:734

评论数:0

hdu1428(spfa与记忆化搜索)

漫步校园 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3508    Accepted Submission(s): 1066 ...

2015-08-30 17:43:49

阅读数:266

评论数:0

poj1459(最大流)

Description A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be suppl...

2015-08-23 12:28:34

阅读数:331

评论数:0

poj1273(最大流)

Description Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by...

2015-08-23 12:21:02

阅读数:412

评论数:0

poj3159(spfa)

Description During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s clas...

2015-08-20 19:08:41

阅读数:393

评论数:0

poj1860(bellman ford 算法)

Description Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies an...

2015-08-20 15:04:26

阅读数:365

评论数:0

hdu1217(floyd算法)

Description Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the ...

2015-08-19 22:16:28

阅读数:285

评论数:0

poj3268(单源最短路,dijkstra算法)

Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1...

2015-08-19 22:05:14

阅读数:445

评论数:0

poj1734(floyd算法)

Description There is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many other attractions, si...

2015-08-19 21:43:59

阅读数:311

评论数:0

hdu1599(floyd算法讲解)

Description 杭州有N个景区,景区之间有一些双向的路来连接,现在8600想找一条旅游路线,这个路线从A点出发并且最后回到A点,假设经过的路线为V1,V2,....VK,V1,那么必须满足K>2,就是说至除了出发点以外至少要经过2个其他不同的景区,而且不能重复经过同一个景区。现在8...

2015-08-19 21:32:50

阅读数:666

评论数:0

poj2513(欧拉回路)

Description You are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a...

2015-08-18 19:47:51

阅读数:302

评论数:0

hdu1116(欧拉回路)

Description Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because...

2015-08-18 19:33:44

阅读数:307

评论数:0

hdu4109(拓扑排序,dp)

Description Ali has taken the Computer Organization and Architecture course this term. He learned that there may be dependence between instructions,...

2015-08-18 19:21:53

阅读数:497

评论数:0

hdu2647(拓扑排序)

Description Dandelion's uncle is a boss of a factory. As the spring festival is coming , he wants to distribute rewards to his workers. Now he has a...

2015-08-18 19:17:58

阅读数:333

评论数:0

hdu2094(水题)

Description 有一群人,打乒乓球比赛,两两捉对撕杀,每两个人之间最多打一场比赛。  球赛的规则如下:  如果A打败了B,B又打败了C,而A与C之间没有进行过比赛,那么就认定,A一定能打败C。  如果A打败了B,B又打败了C,而且,C又打败了A,那么A、B、C三者都不可能成为冠军。  根...

2015-08-18 19:11:05

阅读数:357

评论数:0

hdu1285(图,拓扑排序)

Description 有N个比赛队(1   Input 输入有若干组,每组中的第一行为二个数N(1   Output 给出一个符合要求的排名。输出时队伍号之间有空格,最后一名后面没有空格。  其他说明:符合条件的排名可能不是...

2015-08-18 19:01:48

阅读数:365

评论数:0

AC自动机算法详解

说明转载出处:http://www.cppblog.com/mythit/archive/2009/04/21/80633.html 感谢大牛的博客!! 首先简要介绍一下AC自动机:Aho-Corasick automation,该算法在1975年产生于贝尔实验室,是著名的多模匹配算法之一。一个常...

2015-08-13 21:20:39

阅读数:286

评论数:0

hdu3117(斐波那契数列,矩阵连乘)

Description The Fibonacci sequence is the sequence of numbers such that every element is equal to the sum of the two previous elements, except for...

2015-08-13 17:06:43

阅读数:975

评论数:0

hdu1247(trie树)

Description A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.  You are to find all...

2015-08-12 15:07:43

阅读数:316

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭