小坏蛋_千千

I was caught in a heavy rain!

POJ 3254 Corn Fields (状压dp)

Description Farmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow s...

2017-08-31 21:57:50

阅读数:142

评论数:0

Codeforces 842 D. Vitya and Strange Lesson (trie)

Description Today at the lesson Vitya learned a very interesting function — mex. Mex of a sequence of numbers is the minimum non-negative number th...

2017-08-30 16:17:51

阅读数:757

评论数:0

Codeforces 842 C. Ilya And The Tree (dfs)

Description Ilya is very fond of graphs, especially trees. During his last trip to the forest Ilya found a very interesting tree rooted at vertex 1...

2017-08-30 13:47:31

阅读数:568

评论数:0

UPC 1053 Mysterious Treasure (记忆化搜索)

Description WNJXYK and DIDIDI is playing a game. DIDIDI draws a directed graph G on the paper which contains n points, m directed edges and no cycl...

2017-08-27 17:28:22

阅读数:302

评论数:2

POJ 2104 K-th Number (划分树 / 主席树)

Description You are working for Macrohard company in data structures department. After failing your previous task about key insertion you were aske...

2017-08-23 18:24:14

阅读数:212

评论数:0

HDU 6156 Palindrome Function (数位dp)

Description As we all know,a palindrome number is the number which reads the same backward as forward,such as 666 or 747.Some numbers are not the p...

2017-08-22 21:50:10

阅读数:244

评论数:0

HDU 6170 Two strings (dp)

Description Giving two strings and you should judge if they are matched. The first string contains lowercase letters and uppercase letters. ...

2017-08-22 19:53:59

阅读数:1093

评论数:10

HDU 6154 CaoHaha's staff (数学)

Description “You shall not pass!” After shouted out that,the Force Staff appered in CaoHaha’s hand. As we all know,the Force Staff is a s...

2017-08-21 21:16:21

阅读数:194

评论数:0

HDU 6152 Friend-Graph (最大团)

Description It is well known that small groups are not conducive of the development of a team. Therefore, there shouldn’t be any small groups in a ...

2017-08-20 14:59:28

阅读数:433

评论数:2

HDU 6150 Vertex Cover (构造)

Description As we know, minimumvertexcover is a classical NP-complete problem. There will not be polynomial time algorithm for it unless P=NP. ...

2017-08-20 12:42:03

阅读数:192

评论数:0

HDU 6153 A Secret (扩展KMP)

Description Today is the birthday of SF,so VS gives two strings S1,S2 to SF as a present,which have a big secret.SF is interested in this secret an...

2017-08-20 09:31:20

阅读数:160

评论数:0

POJ 3321 Apple Tree (树状数组)

Description There is an apple tree outside of kaka’s house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he ...

2017-08-19 19:43:52

阅读数:168

评论数:0

HDU 6146 Pokémon GO (dp)

Description 众所周知,度度熊最近沉迷于 Pokémon GO。 今天它决定要抓住所有的精灵球! 为了不让度度熊失望,精灵球已经被事先放置在一个2*N的格子上,每一个格子上都有一个精灵球。度度熊可以选择任意一个格子开始游戏,抓捕格子上的精灵球,然后移动...

2017-08-18 21:22:33

阅读数:652

评论数:0

HDU 6143 Killer Names (容斥)

Description Galen Marek, codenamed Starkiller, was a male Human apprentice of the Sith Lord Darth Vader. A powerful Force-user who lived during the...

2017-08-17 17:50:01

阅读数:1195

评论数:15

HDU 6121 Build a tree (技巧)

Description HazelFan wants to build a rooted tree. The tree has nn nodes labeled 00 to n−1n−1 , and the father of the node labeled ii is the node l...

2017-08-17 10:12:30

阅读数:188

评论数:0

HDU 6129 Just do it (组合数)

Description There is a nonnegative integer sequence a1…n of length n. HazelFan wants to do a type of transformation called prefix-XOR, which means ...

2017-08-16 17:48:39

阅读数:155

评论数:0

BZOJ 2038 小Z的袜子 (莫队算法)

Description 作为一个生活散漫的人,小Z 每天早上都要耗费很久从一堆五颜六色的袜子中找出一双来穿。终于有一天,小Z 再也无法忍受这恼人的找袜子过程,于是他决定听天由命…… 具体来说, 小Z 把这 N 只袜子从 1 到 N 编号,然后从编号 L 到 R ( L 尽管 小Z 并...

2017-08-16 11:52:45

阅读数:164

评论数:0

HDU 4609 3-idiots (FFT)

Description King OMeGa catched three men who had been streaking in the street. Looking as idiots though, the three men insisted that it was a kind ...

2017-08-15 20:57:09

阅读数:173

评论数:0

HDU 6119 小小粉丝度度熊 (枚举 + 二分)

Description 度度熊喜欢着喵哈哈村的大明星——星星小姐。 为什么度度熊会喜欢星星小姐呢? 首先星星小姐笑起来非常动人,其次星星小姐唱歌也非常好听。 但这都不是最重要的,最重要的是,星星小姐拍的一手好代码! 于是度度熊关注了星星小姐的贴吧。 ...

2017-08-14 11:22:56

阅读数:185

评论数:0

HDU 6118 度度熊的交易计划 (最小费用最大流)

Description 度度熊参与了喵哈哈村的商业大会,但是这次商业大会遇到了一个难题: 喵哈哈村以及周围的村庄可以看做是一共由n个片区,m条公路组成的地区。 由于生产能力的区别,第i个片区能够花费a[i]元生产1个商品,但是最多生产b[i]个。 同样的,由于每个...

2017-08-13 19:55:20

阅读数:880

评论数:0

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