Boss.Pi

摘要： A string is finite sequence of characters over a non-empty finite set Σ. In this problem, Σ is the set of lowercase letters. Substring, also called fa 阅读全文

摘要： Little Daniel loves to play with strings! He always finds different ways to have fun with strings! Knowing that, his friend Kinan decided to test his 阅读全文

摘要： You are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal number of times that some string with 阅读全文

摘要： 题目描述 给定一个只包含小写字母的字符串SS, 请你求出 SS 的所有出现次数不为 11 的子串的出现次数乘上该子串长度的最大值。​​ 先讲讲对后缀自动机的理解: 后缀自动机就是后缀树倒过来的样子,很形象. 如ACADD: 其构造的思想大致是： 1.首先将点分为一些类别，其中有一些是接受点，也就是说 阅读全文

摘要： Problem Description Many geometry（几何）problems were designed in the ACM/ICPC. And now, I also prepare a geometry problem for this final exam. According 阅读全文

摘要： Problem Description “ 改革春风吹满地,不会AC没关系;实在不行回老家，还有一亩三分地。谢谢!（乐队奏乐）”话说部分学生心态极好，每天就知道游戏，这次考试如此简单的题目，也是云里雾里，而且，还竟然来这么几句打油诗。好呀，老师的责任就是帮你解决问题，既然想种田，那就分你一块。这块田 阅读全文

摘要： Description Calculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem - their child John never puts his 阅读全文

摘要： 题目描述 P教授要去看奥运，但是他舍不下他的玩具，于是他决定把所有的玩具运到北京。他使用自己的压缩器进行压缩，其可以将任意物品变成一堆，再放到一种特殊的一维容器中。P教授有编号为1...N的N件玩具，第i件玩具经过压缩后变成一维长度为Ci.为了方便整理，P教授要求在一个一维容器中的玩具编号是连续的。 阅读全文

摘要： Problem Description Zero has an old printer that doesn't work well sometimes. As it is antique, he still like to use it to print articles. But it is t 阅读全文

摘要： 【题目描述】 辉辉热衷于洞穴勘测。某天，他按照地图来到了一片被标记为JSZX的洞穴群地区。经过初步勘测，辉辉发现这片区域由n个洞穴（分别编号为1到n）以及若干通道组成，并且每条通道连接了恰好两个洞穴。假如两个洞穴可以通过一条或者多条通道按一定顺序连接起来，那么这两个洞穴就是连通的，按顺序连接在一起的 阅读全文