摘要：
There are N cities in the country, and M directional roads from u to v(1≤u,v≤n). Every road has a distance cici Haze is a Magical Girl that lives in C 阅读全文
摘要：
Problem Description There are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask like this “How 阅读全文
摘要：
先来一段代码压压惊： 想像一下对于一个字符串，如何求它的最长的回文子串，暴力的做法就是枚举每一个点然后往两边扩，但是这个算法的时间复杂度是O(n2)O(n^2)O(n2)时间很不进人意，于是就诞生了Manacher算法 Manacher 开始Manacher之前我们首先要准备两个变量maxr和mid 阅读全文
摘要：
In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacen 阅读全文
摘要：
Problem Description CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there a 阅读全文
摘要：
Describe 有一个神奇的盒子，它有N (2 <= N <= 1e5)个空间，这些空间依次编号为a1,…,aN (0 <= ai <= 1e9). 有x (2 <= x <= N)巧克力，如果多个巧克力放在一个空间就会爆炸。为了不让巧克力爆炸。我们需要使任意两个巧克力之间的最小距离尽可能的大，那 阅读全文
摘要：
Hotel Description The cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and enjoy a vacation on the sunny shores of Lake 阅读全文
摘要：
题意： 五百年后，龙珠的数量会出乎意料地增加，因此孙悟空（吴）将所有的龙球聚集在一起太难了。 他的国家有N个城市，世界上正好有N个龙球。起初，对于第i个龙球，神圣的龙将把它放在第i个城市。长年以来，一些城市的龙球将被运往其他城市。为了挽救体力，吴孔计划采用飞行云中云，一种神奇的飞云收集龙珠。 每次武 阅读全文
摘要：
Description Every cow’s dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 阅读全文
摘要：
Problem Description During the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Gen 阅读全文