LiveArchive
文章平均质量分 89
_OTTFF
这个作者很懒,什么都没留下…
展开
-
LA_3027_POJ_1962_CorporativeNetwork
3027 - Corporative NetworkTime limit: 3.000 secondsA very big corporation is developing its corporative network. In the beginning each of the N enterprises of the corporation, numerated from 1 to原创 2015-08-10 00:09:17 · 344 阅读 · 0 评论 -
LA_4329_HDU_2492_PingPong
4329 - Ping pongTime limit: 3.000 secondsN (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 t原创 2015-08-10 10:17:07 · 588 阅读 · 0 评论 -
LA_3213_AncientCipher
Regionals 2004 >> Europe - Northeastern3213 - Ancient CipherTime limit: 3.000 secondsAncient Roman empire had a strong government system with various departments, including a secretser原创 2015-09-02 21:35:41 · 413 阅读 · 0 评论 -
LA_3602_DNAConsensusString
Regionals 2006 >> Asia - Seoul3602 - DNA Consensus StringTime limit: 3.000 secondsDNA (Deoxyribonucleic Acid) is the molecule which contains the genetic instructions. It consists of fo原创 2015-09-02 21:42:00 · 573 阅读 · 0 评论 -
LA_6439_PastiPas!
Regionals 2013 >> Asia - Jakarta6439 - Pasti Pas!Time limit: 2.000 secondsPertamina is an Indonesian government-owned oil and gas corporation based on Jakarta. It has by farthe largest原创 2015-08-24 15:51:21 · 454 阅读 · 0 评论 -
LA_7401_HDU_5573_BinaryTree
Regionals 2015 >> Asia - Shanghai7401 - Binary TreeTime limit: 3.000 secondsThe Old Frog King lives on the root of an infinite tree. According to the law, each node should connectto ex原创 2016-02-14 18:07:03 · 448 阅读 · 0 评论 -
LA_3026_HDU_1358_Period
这个题目问一个串的所有可能的重复单元长度及重复的次数枚举串匹配好像并不能过这个题目的数据这个题目其实要对KMP的next数组有一定的理解123123123这样的串会在next数组形成怎样的形式其实是解决这个题目的关键#include #include using namespace std;const int MN=1e6+5;char s1[MN];int原创 2016-02-21 22:02:48 · 400 阅读 · 0 评论 -
LA_2659_POJ_3076_ZOJ_3122_Sudoku(DancingLinksX精确覆盖,数独题模板)
SudokuTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 4918 Accepted: 2332DescriptionA Sudoku grid is a 16x16 grid of cells grouped in sixteen 4x4 squ原创 2016-05-01 10:38:44 · 1065 阅读 · 0 评论