1634: [Usaco2007 Jan]Protecting the Flowers 护花Time Limit: 5 SecMemory Limit: 64 MBSubmit: 448Solved: 276[Submit][Status]DescriptionFarmer John went to... Read More
1651: [Usaco2006 Feb]Stall Reservations 专用牛棚Time Limit:10 SecMemory Limit:64 MBSubmit:509Solved:280[Submit][Status]DescriptionOh those picky N (1 >>>>... Read More
1690: [Usaco2007 Dec]奶牛的旅行Time Limit:5 SecMemory Limit:64 MBSubmit:552Solved:286[Submit][Status]Description作为对奶牛们辛勤工作的回报,Farmer John决定带她们去附近的大城市玩一天。旅行... Read More
3172: [Tjoi2013]单词Time Limit:10 SecMemory Limit:512 MBSubmit:1111Solved:513[Submit][Status]Description某人读论文,一篇论文是由许多单词组成。但他发现一个单词会在论文中出现很多次,现在想知道每个单词分... Read More
1717: [Usaco2006 Dec]Milk Patterns 产奶的模式Time Limit:5 SecMemory Limit:64 MBSubmit:491Solved:274[Submit][Status]Description农夫John发现他的奶牛产奶的质量一直在变动。经过细致的调... Read More
1031: [JSOI2007]字符加密CipherTime Limit:10 SecMemory Limit:162 MBSubmit:3146Solved:1226[Submit][Status]Description喜欢钻研问题的JS 同学,最近又迷上了对加密方法的思考。一天,他突然想出了一种... Read More
后缀数组的实现有很多细节:1.da函数中的n 指的是 从 0--n-1 为字符,对这n个后缀排序2.r[n-1]为在原字符串后面加的比前面任何一个字符都小的辅助字符,所以原来的字符串应该是r[0]---r[n-2]3.sa[0]=n-1为增添的辅助字符,所以sa转rank 的时候 i=1 to n-... Read More
1692: [Usaco2007 Dec]队列变换Time Limit:5 SecMemory Limit:64 MBSubmit:594Solved:246[Submit][Status]DescriptionFJ打算带他的N(1 2 #include 3 #include 4 #include... Read More