02 2016 档案

poj1061青蛙的约会 (扩展欧几里德)
摘要：Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要的事情，既没有问清楚对方的特征，也没有约定见面的具体位置。不过青蛙们都是很... 阅读全文
posted @ 2016-02-29 22:06 Herumw 阅读(136) 评论(0) 推荐(0) 编辑
zoj3593One Person Game (扩展欧几里德）
摘要：There is an interesting and simple one person game. Suppose there is a number axis under your feet. You are at point A at first and yo... 阅读全文
posted @ 2016-02-28 21:21 Herumw 阅读(174) 评论(0) 推荐(0) 编辑
Codeforces Round #343 (Div. 2) E. Famil Door and Roads (树形dp,lca)
摘要：Famil Door’s City map looks like a tree (undirected connected acyclic graph) so other people call it Treeland. There are n intersectio... 阅读全文
posted @ 2016-02-25 20:13 Herumw 阅读(196) 评论(0) 推荐(0) 编辑
hdu4028 The time of a day (map+dp)
摘要：Problem DescriptionThere are no days and nights on byte island, so the residents here can hardly determine the length of a single day.... 阅读全文
posted @ 2016-02-24 20:38 Herumw 阅读(110) 评论(0) 推荐(0) 编辑
zoj3777 Problem Arrangement(状压dp，思路赞）
摘要：The 11th Zhejiang Provincial Collegiate Programming Contest is coming! As a problem setter, Edward is going to arrange the order of th... 阅读全文
posted @ 2016-02-24 10:48 Herumw 阅读(126) 评论(0) 推荐(0) 编辑
hdu3905 Sleeping (区间dp）
摘要：Problem DescriptionZZZ is an enthusiastic ACMer and he spends lots of time on training. He always stays up late for training. He needs... 阅读全文
posted @ 2016-02-23 22:59 Herumw 阅读(98) 评论(0) 推荐(0) 编辑
fzu2178礼物分配 (状压+二分)
摘要：Problem Description在双胞胎兄弟Eric与R.W的生日会上，他们共收到了N个礼物，生日过后他们决定分配这N个礼物(numv+numw=N)。对于每个礼物他们俩有着各自心中的价值vi和wi，他们要求各自分到的礼物数目|numv-numw|#includ... 阅读全文
posted @ 2016-02-23 20:18 Herumw 阅读(132) 评论(0) 推荐(0) 编辑
codeforces629C Famil Door and Brackets (dp)
摘要：As Famil Door’s birthday is coming, some of his friends (like Gabi) decided to buy a present for him. His friends are going to buy a s... 阅读全文
posted @ 2016-02-21 23:30 Herumw 阅读(184) 评论(0) 推荐(0) 编辑
hdu1313 Round and Round We Go (大数乘法)
摘要：Problem DescriptionA cyclic number is an integer n digits in length which, when multiplied by any integer from 1 to n, yields a ~{!0~}... 阅读全文
posted @ 2016-02-21 21:37 Herumw 阅读(240) 评论(0) 推荐(0) 编辑
hdu2141 Can you find it? （二分）
摘要：Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find... 阅读全文
posted @ 2016-02-21 21:31 Herumw 阅读(125) 评论(0) 推荐(0) 编辑
CodeForces 630Q Pyramids（数学公式）
摘要：IT City administration has no rest because of the fame of the Pyramids in Egypt. There is a project of construction of pyramid complex... 阅读全文
posted @ 2016-02-20 17:44 Herumw 阅读(272) 评论(0) 推荐(0) 编辑
codeforces 630K Indivisibility （容斥原理）
摘要：IT City company developing computer games decided to upgrade its way to reward its employees. Now it looks the following way. After a ... 阅读全文
posted @ 2016-02-19 22:28 Herumw 阅读(182) 评论(0) 推荐(0) 编辑
codeforces622E Ants in Leaves (dfs)
摘要：DescriptionTree is a connected graph without cycles. A leaf of a tree is any vertex connected with exactly one other vertex.You are gi... 阅读全文
posted @ 2016-02-17 22:02 Herumw 阅读(159) 评论(0) 推荐(0) 编辑
poj2926Requirements (曼哈顿距离)
摘要：DescriptionAn undergraduate student, realizing that he needs to do research to improve his chances of being accepted to graduate schoo... 阅读全文
posted @ 2016-02-16 17:21 Herumw 阅读(188) 评论(0) 推荐(0) 编辑
hdu5627 Clarke and MST (并查集)
摘要：Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 311 Accepted Submission(s):... 阅读全文
posted @ 2016-02-16 14:46 Herumw 阅读(223) 评论(0) 推荐(0) 编辑
codeforces626F Group Projects(dp)
摘要：DescriptionThere are n students in a class working on group projects. The students will divide into groups (some students may be in gr... 阅读全文
posted @ 2016-02-15 21:58 Herumw 阅读(131) 评论(0) 推荐(0) 编辑
codeforces626E.Simple Skewness（三分）
摘要：Define the simple skewness of a collection of numbers to be the collection's mean minus its median. You are given a list of n (not nec... 阅读全文
posted @ 2016-02-15 12:49 Herumw 阅读(259) 评论(0) 推荐(0) 编辑
codeforces626D . Jerry's Protest (概率)
摘要：Andrew and Jerry are playing a game with Harry as the scorekeeper. The game consists of three rounds. In each round, Andrew and Jerry ... 阅读全文
posted @ 2016-02-14 16:45 Herumw 阅读(87) 评论(0) 推荐(0) 编辑
hdu3247Resource Archiver (AC自动机+最短路+状压dp)
摘要：Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 2302 Accepted Submissio... 阅读全文
posted @ 2016-02-13 22:18 Herumw 阅读(170) 评论(0) 推荐(0) 编辑
zoj3545Rescue the Rabbit (AC自动机+状压dp+滚动数组）
摘要：Time Limit: 10 Seconds Memory Limit: 65536 KBDr. X is a biologist, who likes rabbits very much and can do everything for them. 20... 阅读全文
posted @ 2016-02-13 11:24 Herumw 阅读(226) 评论(0) 推荐(0) 编辑
hdu3341Lost's revenge (AC自动机+变进制dp)
摘要：Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3657 Accepted Submission(s... 阅读全文
posted @ 2016-02-13 09:54 Herumw 阅读(209) 评论(0) 推荐(0) 编辑
hdu2457 DNA repair(AC自动机+dp)
摘要：Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1930 Accepted Submission(s)... 阅读全文
posted @ 2016-02-11 21:50 Herumw 阅读(309) 评论(0) 推荐(0) 编辑
hdu2296 Ring (AC自动机+dp)
摘要：Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3056 Accepted Submission(s)... 阅读全文
posted @ 2016-02-11 16:58 Herumw 阅读(211) 评论(0) 推荐(0) 编辑
hdu2825 Wireless Password(AC自动机+状压dp）
摘要：Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5400 Accepted Submission(s)... 阅读全文
posted @ 2016-02-10 21:49 Herumw 阅读(168) 评论(0) 推荐(0) 编辑
hdu1625 Numbering Paths (floyd判环)
摘要：Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 207 Accepted Submission(s):... 阅读全文
posted @ 2016-02-09 21:38 Herumw 阅读(146) 评论(0) 推荐(0) 编辑
hdu2243 考研路茫茫——单词情结 (AC自动机+矩阵快速幂)
摘要：Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4709 Accepted Submission(s)... 阅读全文
posted @ 2016-02-09 16:01 Herumw 阅读(215) 评论(0) 推荐(0) 编辑
poj2778 DNA Sequence(AC自动机+矩阵快速幂）
摘要：DescriptionIt's well known that DNA Sequence is a sequence only contains A, C, T and G, and it's very useful to analyze a segment of D... 阅读全文
posted @ 2016-02-07 16:56 Herumw 阅读(115) 评论(0) 推荐(0) 编辑
poj2001 Shortest Prefixes (trie树)
摘要：DescriptionA prefix of a string is a substring starting at the beginning of the given string. The prefixes of "carbon" are: "c", "ca",... 阅读全文
posted @ 2016-02-05 22:25 Herumw 阅读(196) 评论(0) 推荐(0) 编辑
hdu5536 Chip Factory
摘要：Problem DescriptionJohn is a manager of a CPU chip factory, the factory produces lots of chips everyday. To manage large amounts of pr... 阅读全文
posted @ 2016-02-05 16:27 Herumw 阅读(171) 评论(0) 推荐(0) 编辑
hdu1247 Hat’s Words
摘要：Problem DescriptionA hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.You... 阅读全文
posted @ 2016-02-05 13:37 Herumw 阅读(119) 评论(0) 推荐(0) 编辑
hdu1671 Phone List
摘要：Problem DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. ... 阅读全文
posted @ 2016-02-05 12:11 Herumw 阅读(154) 评论(0) 推荐(0) 编辑
codeforces 607B. Zuma
摘要：Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The g... 阅读全文
posted @ 2016-02-05 08:15 Herumw 阅读(154) 评论(0) 推荐(0) 编辑
bzoj3289 : Mato的文件管理
摘要：DescriptionMato同学从各路神犇以各种方式（你们懂的）收集了许多资料，这些资料一共有n份，每份有一个大小和一个编号。为了防止他人偷拷，这些资料都是加密过的，只能用Mato自己写的程序才能访问。Mato每天随机选一个区间[l,r]，他今天就看编号在此区间内的... 阅读全文
posted @ 2016-02-04 20:23 Herumw 阅读(101) 评论(0) 推荐(0) 编辑
codeforces 86D D. Powerful array
摘要：An array of positive integers a1, a2, ..., an is given. Let us consider its arbitrary subarray al, al + 1..., ar, where 1 ≤ l ≤ r ≤ n.... 阅读全文
posted @ 2016-02-04 18:25 Herumw 阅读(105) 评论(0) 推荐(0) 编辑
Codeforces Round #340 (Div. 2) E. XOR and Favorite Number
摘要：time limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBob has a favorite number k and ... 阅读全文
posted @ 2016-02-04 15:00 Herumw 阅读(115) 评论(0) 推荐(0) 编辑
bzoj 2038: [2009国家集训队]小Z的袜子(hose)
摘要：Time Limit: 20 Sec Memory Limit: 259 MBSubmit: 5307 Solved: 2450[Submit][Status][Discuss]Description作为一个生活散漫的人，小Z每天早上都要耗费很久从一堆五颜六色的袜... 阅读全文
posted @ 2016-02-04 12:44 Herumw 阅读(123) 评论(0) 推荐(0) 编辑
hdu1251 统计难题
摘要：Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 27751 Accepted Submission(... 阅读全文
posted @ 2016-02-03 21:39 Herumw 阅读(99) 评论(0) 推荐(0) 编辑
Codeforces Round #341 (Div. 2) E. Wet Shark and Blocks
摘要：There are b blocks of digits. Each one consisting of the same n digits, which are given to you in the input. Wet Shark must chooseexac... 阅读全文
posted @ 2016-02-03 09:52 Herumw 阅读(141) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示